TSTP Solution File: GRP190-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP190-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 11:37:28 EDT 2022
% Result : Unsatisfiable 1.65s 1.81s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 21 ( 20 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(monotony_lub1,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(p39c_1,hypothesis,
least_upper_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39c_1) ).
cnf(prove_p39c,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39c) ).
cnf(68,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(69,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(75,plain,
multiply(X,a) = least_upper_bound(multiply(X,a),multiply(X,b)),
inference('PARAMODULATE',[status(thm)],[monotony_lub1,p39c_1,theory(equality)]) ).
cnf(130,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[68,left_inverse,theory(equality)]) ).
cnf(131,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[68,68,theory(equality)]) ).
cnf(132,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[130,131,theory(equality)]) ).
cnf(133,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[69,132,theory(equality)]) ).
cnf(141,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[133,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(148,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[133,141,theory(equality)]) ).
cnf(180,plain,
identity = least_upper_bound(identity,multiply(inverse(a),b)),
inference('PARAMODULATE',[status(thm)],[75,left_inverse,theory(equality)]) ).
cnf(198,plain,
X = least_upper_bound(X,multiply(multiply(inverse(a),b),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_lub2,180,theory(equality)]),left_identity,theory(equality)]) ).
cnf(806,plain,
inverse(b) = least_upper_bound(inverse(b),inverse(a)),
inference('PARAMODULATE',[status(thm)],[198,148,theory(equality)]) ).
cnf(830,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[glb_absorbtion,806,theory(equality)]),prove_p39c]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP190-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 15:52:08 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.48 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49 *
% 0.21/0.49 *
% 0.21/0.50 #<PACKAGE "SNARK-USER">
% 0.21/0.50 *
% 0.21/0.50 SNARK-TPTP-OPTIONS
% 0.21/0.50 *
% 0.21/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50 (USE-FACTORING :POS)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50 *
% 0.21/0.50 "."
% 0.21/0.50 *
% 0.21/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T15:52:08
% 0.21/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-06-13T15:52:08
% 0.34/0.52
% 0.34/0.52 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.34/0.52 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.34/0.52 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.34/0.52 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.34/0.52 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.34/0.52 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.34/0.52 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.34/0.52 ; Declaring greatest_lower_bound to be commutative.
% 0.34/0.52 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.34/0.52 ; Declaring least_upper_bound to be commutative.
% 1.65/1.81 ; Declaring least_upper_bound to be associative-commutative.
% 1.65/1.81
% 1.65/1.81 #||
% 1.65/1.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.65/1.81 % SZS output start Refutation
% See solution above
% 1.65/1.81 ||#
% 1.65/1.81
% 1.65/1.81 ; Summary of computation:
% 1.65/1.81 ; 4094 formulas have been input or derived (from 75 formulas).
% 1.65/1.81 ; 830 (20%) were retained. Of these,
% 1.65/1.81 ; 72 ( 9%) were simplified or subsumed later,
% 1.65/1.81 ; 758 (91%) are still being kept.
% 1.65/1.81 ;
% 1.65/1.81 ; Run time in seconds excluding printing time:
% 1.65/1.81 ; 0.004 0% Read assertion file (1 call)
% 1.65/1.81 ; 0.000 0% Assert (17 calls)
% 1.65/1.81 ; 0.092 7% Process new row (4,002 calls)
% 1.65/1.81 ; 0.007 1% Resolution (148 calls)
% 1.65/1.81 ; 0.104 8% Paramodulation (74 calls)
% 1.65/1.81 ; 0.016 1% Embedding (395 calls)
% 1.65/1.81 ; 0.984 75% Forward simplification (3,543 calls)
% 1.65/1.81 ; 0.025 2% Backward simplification (439 calls)
% 1.65/1.81 ; 0.021 2% Ordering (6,597 calls)
% 1.65/1.81 ; 0.011 1% Ordering ac (1,455 calls)
% 1.65/1.81 ; 0.000 0% Sortal reasoning (32 calls)
% 1.65/1.81 ; 0.000 0% Purity testing (1 call)
% 1.65/1.81 ; 0.047 4% Other
% 1.65/1.81 ; 1.311 Total
% 1.65/1.81 ; 1.312 Real time
% 1.65/1.81 ;
% 1.65/1.81 ; Term-hash-array has 2,420 terms in all.
% 1.65/1.81 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.65/1.81 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.65/1.81 ; Path-index has 2,242 entries (2,242 at peak, 2,433 added, 191 deleted).
% 1.65/1.81 ; Path-index has 1,006 nodes (1,006 at peak, 1,052 added, 46 deleted).
% 1.65/1.81 ; Trie-index has 2,242 entries (2,242 at peak, 2,433 added, 191 deleted).
% 1.65/1.81 ; Trie-index has 639 nodes (639 at peak, 778 added, 139 deleted).
% 1.65/1.81 ; Retrieved 1,725,462 generalization terms in 36,931 calls.
% 1.65/1.81 ; Retrieved 2,336 instance terms in 469 calls.
% 1.65/1.81 ; Retrieved 13,995 unifiable terms in 433 calls.
% 1.65/1.81 ;
% 1.65/1.81 ; The agenda of rows to process has 2 entries:
% 1.65/1.81 ; 2 with value 23
% 1.65/1.81 ; The agenda of rows to give has 690 entries:
% 1.65/1.81 ; 1 with value (4 15) 46 with value (4 28) 16 with value (4 38)
% 1.65/1.81 ; 16 with value (4 18) 30 with value (4 29) 12 with value (4 39)
% 1.65/1.81 ; 20 with value (4 19) 32 with value (4 30) 4 with value (4 40)
% 1.65/1.81 ; 26 with value (4 20) 40 with value (4 31) 2 with value (4 41)
% 1.65/1.81 ; 24 with value (4 21) 30 with value (4 32) 6 with value (4 42)
% 1.65/1.81 ; 27 with value (4 22) 28 with value (4 33) 2 with value (4 43)
% 1.65/1.81 ; 41 with value (4 23) 20 with value (4 34) 6 with value (4 44)
% 1.65/1.81 ; 68 with value (4 24) 8 with value (4 35) 4 with value (4 45)
% 1.65/1.81 ; 54 with value (4 25) 14 with value (4 36) 2 with value (4 49)
% 1.65/1.81 ; 45 with value (4 26) 12 with value (4 37) 2 with value (4 51)
% 1.65/1.81 ; 52 with value (4 27)
% 1.65/1.81 Evaluation took:
% 1.65/1.81 1.313 seconds of real time
% 1.65/1.81 1.268736 seconds of user run time
% 1.65/1.81 0.043838 seconds of system run time
% 1.65/1.81 [Run times include 0.036 seconds GC run time.]
% 1.65/1.81 0 calls to %EVAL
% 1.65/1.81 0 page faults and
% 1.65/1.81 80,834,664 bytes consed.
% 1.65/1.81 :PROOF-FOUND
% 1.65/1.81 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T15:52:09
% 1.65/1.81 :PROOF-FOUND
% 1.65/1.81 *
%------------------------------------------------------------------------------