TSTP Solution File: GRP297-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP297-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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:48 EDT 2022
% Result : Unsatisfiable 127.46s 127.76s
% Output : Refutation 127.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of clauses : 54 ( 21 unt; 21 nHn; 42 RR)
% Number of literals : 121 ( 120 equ; 52 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 36 ( 0 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(prove_this_1,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c5
| multiply(sk_c6,sk_c7) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c5
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(sk_c3,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c3,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_17,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c7,sk_c5) = sk_c6
| inverse(sk_c2) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c7,sk_c5) = sk_c6
| multiply(sk_c2,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c5
| multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(Y) != sk_c7
| multiply(Y,sk_c6) != sk_c7
| multiply(Z,U) != sk_c6
| inverse(Z) != U
| multiply(U,sk_c7) != sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(32,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(33,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(107,plain,
( multiply(sk_c2,sk_c6) = sk_c7
| multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(sk_c7) != sk_c7
| sk_c5 != sk_c7
| multiply(Y,Z) != sk_c6
| inverse(Y) != Z
| multiply(Z,sk_c7) != sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[prove_this_25,prove_this_3,theory(equality)]),theory(equality)]) ).
cnf(120,plain,
( inverse(sk_c1) = sk_c7
| multiply(sk_c7,sk_c6) != sk_c5
| multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(sk_c2) != sk_c7
| multiply(Y,Z) != sk_c6
| inverse(Y) != Z
| multiply(Z,sk_c7) != sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[prove_this_25,prove_this_15,theory(equality)]),theory(equality)]) ).
cnf(151,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[32,left_inverse,theory(equality)]) ).
cnf(152,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[32,32,theory(equality)]) ).
cnf(153,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[151,152,theory(equality)]) ).
cnf(155,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[33,153,theory(equality)]) ).
cnf(156,plain,
( inverse(sk_c1) = sk_c7
| sk_c4 = multiply(inverse(sk_c3),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[32,prove_this_16,theory(equality)]) ).
cnf(188,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[155,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(199,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,188,theory(equality)]) ).
cnf(200,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[155,188,theory(equality)]) ).
cnf(213,plain,
( inverse(sk_c2) = sk_c7
| multiply(sk_c6,inverse(sk_c5)) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[200,prove_this_20,theory(equality)]) ).
cnf(224,plain,
( multiply(sk_c2,sk_c6) = sk_c7
| multiply(sk_c6,inverse(sk_c5)) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[200,prove_this_21,theory(equality)]) ).
cnf(248,plain,
( inverse(sk_c1) = sk_c7
| sk_c4 = multiply(sk_c4,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[156,prove_this_17,theory(equality)]) ).
cnf(255,plain,
( inverse(sk_c1) = sk_c7
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[32,248,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(261,plain,
( identity = sk_c6
| multiply(sk_c1,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[199,255,theory(equality)]) ).
cnf(273,plain,
( identity = sk_c6
| inverse(sk_c3) = sk_c4 ),
inference('PARAMODULATE',[status(thm)],[prove_this_11,261,theory(equality)]) ).
cnf(275,plain,
( identity = sk_c6
| multiply(sk_c3,sk_c4) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_10,261,theory(equality)]) ).
cnf(278,plain,
( identity = sk_c6
| multiply(sk_c3,sk_c4) = identity ),
inference('PARAMODULATE',[status(thm)],[199,273,theory(equality)]) ).
cnf(675,plain,
identity = sk_c6,
inference('PARAMODULATE',[status(thm)],[275,278,theory(equality)]) ).
cnf(676,plain,
sk_c5 = sk_c7,
inference('REWRITE',[status(thm)],[prove_this_1,left_identity,153,675,theory(equality)]) ).
cnf(785,plain,
( multiply(sk_c5,sk_c5) = identity
| sk_c2 = sk_c5 ),
inference('REWRITE',[status(thm)],[prove_this_21,153,676,675,theory(equality)]) ).
cnf(789,plain,
( multiply(X,sk_c5) != identity
| inverse(X) != sk_c5
| multiply(sk_c5,sk_c5) != identity
| inverse(Y) != sk_c5
| Y != sk_c5 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[prove_this_25,left_identity,153,676,675,theory(equality)])]) ).
cnf(821,plain,
( sk_c2 = sk_c5
| multiply(sk_c5,sk_c5) != identity
| inverse(sk_c5) != sk_c5 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[107,left_identity,676,153,675,theory(equality)])]) ).
cnf(827,plain,
( inverse(sk_c1) = sk_c5
| multiply(X,sk_c5) != identity
| inverse(X) != sk_c5
| multiply(sk_c5,sk_c5) != identity
| inverse(sk_c2) != sk_c5 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[120,left_identity,153,676,675,theory(equality)])]) ).
cnf(844,plain,
( inverse(sk_c2) = sk_c5
| inverse(sk_c5) = sk_c5 ),
inference('REWRITE',[status(thm)],[213,left_identity,676,675,theory(equality)]) ).
cnf(847,plain,
( sk_c2 = sk_c5
| inverse(sk_c5) = sk_c5 ),
inference('REWRITE',[status(thm)],[224,left_identity,676,153,675,theory(equality)]) ).
cnf(908,plain,
( multiply(sk_c5,sk_c5) != identity
| inverse(X) != sk_c5
| X != sk_c5 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[789,left_inverse,theory(equality)]),188,theory(equality)]) ).
cnf(1420,plain,
sk_c2 = sk_c5,
inference('HYPERRESOLVE',[status(thm)],[821,785,847]) ).
cnf(1512,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c2,sk_c2) != identity
| sk_c2 != inverse(sk_c2) ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[827,1420,theory(equality)])]) ).
cnf(1519,plain,
sk_c2 = inverse(sk_c2),
inference('REWRITE',[status(thm)],[844,1420,theory(equality)]) ).
cnf(1527,plain,
( inverse(sk_c1) = sk_c2
| multiply(sk_c2,sk_c2) != identity ),
inference('REWRITE',[status(thm)],[1512,1519,theory(equality)]) ).
cnf(1551,plain,
( multiply(sk_c2,sk_c2) != identity
| inverse(X) != sk_c2
| X != sk_c2 ),
inference('REWRITE',[status(thm)],[908,1420,theory(equality)]) ).
cnf(1718,plain,
multiply(sk_c2,sk_c2) = identity,
inference('PARAMODULATE',[status(thm)],[199,1519,theory(equality)]) ).
cnf(1725,plain,
inverse(sk_c1) = sk_c2,
inference('REWRITE',[status(thm)],[1527,1718,theory(equality)]) ).
cnf(1729,plain,
( inverse(X) != sk_c2
| X != sk_c2 ),
inference('REWRITE',[status(thm)],[1551,1718,theory(equality)]) ).
cnf(1755,plain,
sk_c1 = sk_c2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[188,1725,theory(equality)]),1519,theory(equality)]) ).
cnf(1770,plain,
inverse(sk_c1) = sk_c1,
inference('REWRITE',[status(thm)],[1519,1755,theory(equality)]) ).
cnf(1783,plain,
( inverse(X) != sk_c1
| X != sk_c1 ),
inference('REWRITE',[status(thm)],[1729,1755,theory(equality)]) ).
cnf(1791,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[1783,1770,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP297-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 20:29:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T20:29:33
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-13T20:29:33
% 0.18/0.48
% 0.18/0.48 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.18/0.48 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 127.46/127.76 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 127.46/127.76
% 127.46/127.76 #||
% 127.46/127.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 127.46/127.76 % SZS output start Refutation
% See solution above
% 127.46/127.77 ||#
% 127.46/127.77
% 127.46/127.77 ; Summary of computation:
% 127.46/127.77 ; 355380 formulas have been input or derived (from 247 formulas).
% 127.46/127.77 ; 1791 ( 1%) were retained. Of these,
% 127.46/127.77 ; 1745 (97%) were simplified or subsumed later,
% 127.46/127.77 ; 46 ( 3%) are still being kept.
% 127.46/127.77 ;
% 127.46/127.77 ; Run time in seconds excluding printing time:
% 127.46/127.77 ; 0.005 0% Read assertion file (1 call)
% 127.46/127.77 ; 0.002 0% Assert (28 calls)
% 127.46/127.77 ; 1.100 1% Process new row (155,787 calls)
% 127.46/127.77 ; 50.697 40% Resolution (492 calls)
% 127.46/127.77 ; 0.051 0% Paramodulation (246 calls)
% 127.46/127.77 ; 0.001 0% Factoring (211 calls)
% 127.46/127.77 ; 0.373 0% Condensing (153,865 calls)
% 127.46/127.77 ; 56.778 45% Forward subsumption (153,865 calls)
% 127.46/127.77 ; 0.050 0% Backward subsumption (1,709 calls)
% 127.46/127.77 ; 7.823 6% Clause clause subsumption (1,110,365 calls)
% 127.46/127.77 ; 9.363 7% Forward simplification (155,454 calls)
% 127.46/127.77 ; 0.053 0% Backward simplification (1,791 calls)
% 127.46/127.77 ; 0.320 0% Ordering (165,595 calls)
% 127.46/127.77 ; 0.000 0% Sortal reasoning (32 calls)
% 127.46/127.77 ; 0.000 0% Purity testing (1 call)
% 127.46/127.77 ; 0.596 0% Other
% 127.46/127.77 ; 127.212 Total
% 127.46/127.77 ; 127.306 Real time
% 127.46/127.77 ;
% 127.46/127.77 ; Term-hash-array has 1,169 terms in all.
% 127.46/127.77 ; Feature-vector-row-index has 2 entries (673 at peak, 1,709 added, 1,707 deleted).
% 127.46/127.77 ; Feature-vector-row-index has 12 nodes (4,175 at peak, 9,527 added, 9,515 deleted).
% 127.46/127.77 ; Retrieved 6,066,176 possibly forward subsuming rows in 153,865 calls.
% 127.46/127.77 ; Retrieved 1,343 possibly backward subsumed rows in 1,709 calls.
% 127.46/127.77 ; Path-index has 133 entries (606 at peak, 1,469 added, 1,336 deleted).
% 127.46/127.77 ; Path-index has 212 nodes (366 at peak, 610 added, 398 deleted).
% 127.46/127.77 ; Trie-index has 133 entries (606 at peak, 1,469 added, 1,336 deleted).
% 127.46/127.77 ; Trie-index has 389 nodes (1,517 at peak, 3,228 added, 2,839 deleted).
% 127.46/127.77 ; Retrieved 6,646 generalization terms in 1,794,769 calls.
% 127.46/127.77 ; Retrieved 183 instance terms in 104 calls.
% 127.46/127.77 ; Retrieved 36,852,780 unifiable terms in 1,238,848 calls.
% 127.46/127.77 ;
% 127.46/127.77 ; The agenda of rows to process has 19 entries:
% 127.46/127.77 ; 3 with value 8 3 with value 12 1 with value 16
% 127.46/127.77 ; 3 with value 9 4 with value 13 1 with value 17
% 127.46/127.77 ; 1 with value 10 1 with value 15 1 with value 18
% 127.46/127.77 ; 1 with value 11
% 127.46/127.77 ; The agenda of rows to give has 24 entries:
% 127.46/127.77 ; 1 with value (4 12) 6 with value (4 20) 1 with value (4 23)
% 127.46/127.77 ; 2 with value (4 15) 2 with value (4 21) 4 with value (4 24)
% 127.46/127.77 ; 3 with value (4 18) 1 with value (4 22) 1 with value (4 26)
% 127.46/127.77 ; 3 with value (4 19)
% 127.46/127.77 Evaluation took:
% 127.46/127.77 127.306 seconds of real time
% 127.46/127.77 124.12961 seconds of user run time
% 127.46/127.77 3.092265 seconds of system run time
% 127.46/127.77 [Run times include 4.562 seconds GC run time.]
% 127.46/127.77 0 calls to %EVAL
% 127.46/127.77 0 page faults and
% 127.46/127.77 11,440,075,200 bytes consed.
% 127.46/127.77 :PROOF-FOUND
% 127.46/127.77 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T20:31:40
% 127.46/127.77 :PROOF-FOUND
% 127.46/127.77 *
%------------------------------------------------------------------------------