TSTP Solution File: GRP253-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP253-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n016.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:40 EDT 2022
% Result : Unsatisfiable 17.63s 17.80s
% Output : Refutation 17.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 16 unt; 26 nHn; 35 RR)
% Number of literals : 104 ( 103 equ; 36 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 35 ( 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_2,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_5,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c5
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c2) = sk_c6
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_19,negated_conjecture,
( multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(Y,sk_c6) != sk_c5
| inverse(Y) != sk_c6
| inverse(Z) != sk_c6
| multiply(Z,sk_c5) != sk_c6
| multiply(U,sk_c7) != sk_c6
| inverse(U) != sk_c7
| inverse(sk_c5) != sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(23,plain,
( multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| inverse(Y) != sk_c6
| multiply(Y,sk_c5) != sk_c6
| multiply(Z,sk_c7) != sk_c6
| inverse(Z) != sk_c7
| inverse(sk_c5) != sk_c6 ),
inference('CONDENSE',[status(thm)],[prove_this_19]) ).
cnf(31,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(32,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(73,plain,
( multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| inverse(Y) != sk_c6
| multiply(Y,sk_c5) != sk_c6
| identity != sk_c6
| inverse(inverse(sk_c7)) != sk_c7
| inverse(sk_c5) != sk_c6 ),
inference('PARAMODULATE',[status(thm)],[23,left_inverse,theory(equality)]) ).
cnf(102,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[31,left_inverse,theory(equality)]) ).
cnf(103,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]) ).
cnf(104,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[102,103,theory(equality)]) ).
cnf(105,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[32,104,theory(equality)]) ).
cnf(113,plain,
( inverse(sk_c2) = sk_c6
| sk_c7 = multiply(inverse(sk_c4),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[31,prove_this_10,theory(equality)]) ).
cnf(114,plain,
( inverse(sk_c1) = sk_c7
| sk_c7 = multiply(inverse(sk_c4),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[31,prove_this_4,theory(equality)]) ).
cnf(115,plain,
multiply(multiply(X,inverse(Y)),multiply(Y,Z)) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[associativity,31,theory(equality)]) ).
cnf(126,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,104,theory(equality)]) ).
cnf(130,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[105,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(131,plain,
( multiply(X,sk_c6) != sk_c5
| inverse(X) != sk_c6
| inverse(Y) != sk_c6
| multiply(Y,sk_c5) != sk_c6
| identity != sk_c6
| inverse(sk_c5) != sk_c6 ),
inference('REWRITE',[status(thm)],[73,130,theory(equality)]) ).
cnf(143,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,130,theory(equality)]) ).
cnf(156,plain,
( inverse(sk_c2) = sk_c6
| multiply(sk_c5,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[143,prove_this_12,theory(equality)]) ).
cnf(258,plain,
( inverse(sk_c2) = sk_c6
| sk_c7 = multiply(sk_c7,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[113,prove_this_11,theory(equality)]) ).
cnf(298,plain,
( inverse(sk_c1) = sk_c7
| sk_c7 = multiply(sk_c7,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[114,prove_this_5,theory(equality)]) ).
cnf(304,plain,
( inverse(sk_c1) = sk_c7
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[31,298,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(309,plain,
( identity = sk_c6
| multiply(sk_c1,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[143,304,theory(equality)]) ).
cnf(323,plain,
( identity = sk_c6
| inverse(sk_c5) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_3,309,theory(equality)]) ).
cnf(324,plain,
( identity = sk_c6
| inverse(sk_c4) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_2,309,theory(equality)]) ).
cnf(337,plain,
( identity = sk_c6
| multiply(sk_c4,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[143,324,theory(equality)]) ).
cnf(430,plain,
( inverse(sk_c2) = sk_c6
| X = multiply(X,sk_c6) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[115,258,theory(equality)]),105,theory(equality)]) ).
cnf(475,plain,
( inverse(sk_c2) = sk_c6
| identity = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[156,430,theory(equality)]) ).
cnf(482,plain,
( identity = sk_c5
| multiply(sk_c2,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[143,475,theory(equality)]) ).
cnf(542,plain,
( identity = sk_c5
| inverse(sk_c5) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_9,482,theory(equality)]) ).
cnf(552,plain,
( identity = sk_c5
| sk_c5 = inverse(sk_c6) ),
inference('PARAMODULATE',[status(thm)],[130,542,theory(equality)]) ).
cnf(683,plain,
( identity = sk_c6
| multiply(sk_c2,sk_c6) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_7,337,theory(equality)]) ).
cnf(1582,plain,
( identity = sk_c6
| identity = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[482,683,theory(equality)]) ).
cnf(1594,plain,
identity = sk_c5,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[552,1582,theory(equality)]),126,theory(equality)]) ).
cnf(1647,plain,
( multiply(X,sk_c6) != identity
| inverse(X) != sk_c6
| inverse(Y) != sk_c6
| Y != sk_c6
| identity != sk_c6 ),
inference('REWRITE',[status(thm)],[131,126,104,1594,theory(equality)]) ).
cnf(1658,plain,
identity = sk_c6,
inference('REWRITE',[status(thm)],[323,126,1594,theory(equality)]) ).
cnf(1778,plain,
( inverse(X) != identity
| X != identity ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[1647,104,1658,theory(equality)])]) ).
cnf(1834,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[1778,126,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP253-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 02:55:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49 *
% 0.19/0.49 *
% 0.19/0.49 #<PACKAGE "SNARK-USER">
% 0.19/0.49 *
% 0.19/0.49 SNARK-TPTP-OPTIONS
% 0.19/0.49 *
% 0.19/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.49 (USE-FACTORING :POS)
% 0.19/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.49 *
% 0.19/0.49 "."
% 0.19/0.49 *
% 0.19/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T02:55:15
% 0.19/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-14T02:55:15
% 0.19/0.51
% 0.19/0.51 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.51 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 17.63/17.80 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 17.63/17.80
% 17.63/17.80 #||
% 17.63/17.80 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.63/17.80 % SZS output start Refutation
% See solution above
% 17.63/17.80 ||#
% 17.63/17.80
% 17.63/17.80 ; Summary of computation:
% 17.63/17.80 ; 110470 formulas have been input or derived (from 232 formulas).
% 17.63/17.80 ; 1834 ( 2%) were retained. Of these,
% 17.63/17.80 ; 1545 (84%) were simplified or subsumed later,
% 17.63/17.80 ; 289 (16%) are still being kept.
% 17.63/17.80 ;
% 17.63/17.80 ; Run time in seconds excluding printing time:
% 17.63/17.80 ; 0.005 0% Read assertion file (1 call)
% 17.63/17.80 ; 0.001 0% Assert (22 calls)
% 17.63/17.80 ; 0.446 3% Process new row (71,373 calls)
% 17.63/17.80 ; 3.974 23% Resolution (462 calls)
% 17.63/17.80 ; 0.096 1% Paramodulation (231 calls)
% 17.63/17.80 ; 0.000 0% Factoring (210 calls)
% 17.63/17.80 ; 0.132 1% Condensing (69,154 calls)
% 17.63/17.80 ; 8.699 50% Forward subsumption (69,154 calls)
% 17.63/17.80 ; 0.074 0% Backward subsumption (1,766 calls)
% 17.63/17.80 ; 1.170 7% Clause clause subsumption (298,716 calls)
% 17.63/17.80 ; 2.355 14% Forward simplification (71,049 calls)
% 17.63/17.80 ; 0.052 0% Backward simplification (1,833 calls)
% 17.63/17.80 ; 0.061 0% Ordering (28,903 calls)
% 17.63/17.80 ; 0.000 0% Sortal reasoning (32 calls)
% 17.63/17.80 ; 0.000 0% Purity testing (1 call)
% 17.63/17.80 ; 0.241 1% Other
% 17.63/17.80 ; 17.306 Total
% 17.63/17.80 ; 17.309 Real time
% 17.63/17.80 ;
% 17.63/17.80 ; Term-hash-array has 1,086 terms in all.
% 17.63/17.80 ; Feature-vector-row-index has 237 entries (1,411 at peak, 1,766 added, 1,529 deleted).
% 17.63/17.80 ; Feature-vector-row-index has 761 nodes (6,707 at peak, 8,630 added, 7,869 deleted).
% 17.63/17.80 ; Retrieved 1,750,171 possibly forward subsuming rows in 69,154 calls.
% 17.63/17.80 ; Retrieved 2,187 possibly backward subsumed rows in 1,766 calls.
% 17.63/17.80 ; Path-index has 346 entries (989 at peak, 1,188 added, 842 deleted).
% 17.63/17.80 ; Path-index has 417 nodes (580 at peak, 661 added, 244 deleted).
% 17.63/17.80 ; Trie-index has 346 entries (989 at peak, 1,188 added, 842 deleted).
% 17.63/17.80 ; Trie-index has 1,060 nodes (2,509 at peak, 2,956 added, 1,896 deleted).
% 17.63/17.80 ; Retrieved 10,988 generalization terms in 624,608 calls.
% 17.63/17.80 ; Retrieved 297 instance terms in 121 calls.
% 17.63/17.80 ; Retrieved 1,421,975 unifiable terms in 27,518 calls.
% 17.63/17.80 ;
% 17.63/17.80 ; The agenda of rows to process has 26 entries:
% 17.63/17.80 ; 2 with value 8 4 with value 13 1 with value 17
% 17.63/17.80 ; 1 with value 9 2 with value 14 2 with value 18
% 17.63/17.80 ; 1 with value 11 2 with value 15 2 with value 21
% 17.63/17.80 ; 3 with value 12 4 with value 16 2 with value 24
% 17.63/17.80 ; The agenda of rows to give has 250 entries:
% 17.63/17.80 ; 1 with value (4 12) 15 with value (4 19) 26 with value (4 24)
% 17.63/17.80 ; 9 with value (4 14) 26 with value (4 20) 59 with value (4 25)
% 17.63/17.80 ; 6 with value (4 15) 9 with value (4 21) 20 with value (4 26)
% 17.63/17.80 ; 3 with value (4 16) 14 with value (4 22) 13 with value (4 27)
% 17.63/17.80 ; 7 with value (4 17) 17 with value (4 23) 3 with value (4 28)
% 17.63/17.80 ; 22 with value (4 18)
% 17.63/17.80 Evaluation took:
% 17.63/17.80 17.309 seconds of real time
% 17.63/17.80 16.465929 seconds of user run time
% 17.63/17.80 0.842932 seconds of system run time
% 17.63/17.80 [Run times include 0.771 seconds GC run time.]
% 17.63/17.80 0 calls to %EVAL
% 17.63/17.80 0 page faults and
% 17.63/17.80 1,860,752,080 bytes consed.
% 17.63/17.80 :PROOF-FOUND
% 17.63/17.80 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T02:55:33
% 17.63/17.80 :PROOF-FOUND
% 17.63/17.80 *
%------------------------------------------------------------------------------