TSTP Solution File: GRP229-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP229-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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:36 EDT 2022
% Result : Unsatisfiable 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 33
% Syntax : Number of clauses : 92 ( 23 unt; 62 nHn; 85 RR)
% Number of literals : 189 ( 188 equ; 41 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 30 ( 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,
( inverse(sk_c1) = sk_c8
| inverse(sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_5,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| inverse(sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c8,sk_c3) = sk_c7
| inverse(sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c8,sk_c3) = sk_c7
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c8,sk_c3) = sk_c7
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c8,sk_c3) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c8,sk_c3) = sk_c7
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c3
| inverse(sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c3
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c3
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c3
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c3
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c3
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_26,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_27,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_28,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_28) ).
cnf(prove_this_29,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).
cnf(prove_this_30,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_30) ).
cnf(prove_this_31,negated_conjecture,
( inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8
| multiply(sk_c8,Y) != sk_c7
| multiply(Z,sk_c8) != Y
| inverse(Z) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(U) != sk_c8
| multiply(U,sk_c7) != sk_c8
| multiply(sk_c8,V) != sk_c7
| multiply(W,sk_c8) != V
| inverse(W) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).
cnf(35,plain,
( inverse(sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8
| multiply(sk_c8,Y) != sk_c7
| multiply(Z,sk_c8) != Y
| inverse(Z) != sk_c8 ),
inference('CONDENSE',[status(thm)],[prove_this_31]) ).
cnf(43,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(98,plain,
inverse(sk_c2) = sk_c8,
inference('HYPERRESOLVE',[status(thm)],[35,prove_this_25,prove_this_26,prove_this_27,prove_this_28,prove_this_29,prove_this_30]) ).
cnf(99,plain,
inverse(sk_c1) = sk_c8,
inference('HYPERRESOLVE',[status(thm)],[35,prove_this_1,prove_this_2,prove_this_3,prove_this_4,prove_this_5,prove_this_6]) ).
cnf(103,plain,
( inverse(sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8
| multiply(sk_c8,Y) != sk_c7
| identity != Y
| inverse(inverse(sk_c8)) != sk_c8 ),
inference('PARAMODULATE',[status(thm)],[35,left_inverse,theory(equality)]) ).
cnf(122,plain,
multiply(sk_c8,sk_c2) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,98,theory(equality)]) ).
cnf(125,plain,
multiply(sk_c8,sk_c1) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,99,theory(equality)]) ).
cnf(135,plain,
sk_c2 = multiply(inverse(sk_c8),identity),
inference('PARAMODULATE',[status(thm)],[43,122,theory(equality)]) ).
cnf(136,plain,
sk_c1 = sk_c2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,125,theory(equality)]),135,theory(equality)]) ).
cnf(137,plain,
( multiply(sk_c1,sk_c8) = sk_c3
| inverse(sk_c8) = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_19,136,theory(equality)]) ).
cnf(138,plain,
( multiply(sk_c1,sk_c8) = sk_c3
| inverse(sk_c4) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_20,136,theory(equality)]) ).
cnf(139,plain,
( multiply(sk_c1,sk_c8) = sk_c3
| multiply(sk_c4,sk_c7) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_21,136,theory(equality)]) ).
cnf(140,plain,
( multiply(sk_c1,sk_c8) = sk_c3
| multiply(sk_c8,sk_c6) = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_22,136,theory(equality)]) ).
cnf(141,plain,
( multiply(sk_c1,sk_c8) = sk_c3
| multiply(sk_c5,sk_c8) = sk_c6 ),
inference('REWRITE',[status(thm)],[prove_this_23,136,theory(equality)]) ).
cnf(142,plain,
( multiply(sk_c1,sk_c8) = sk_c3
| inverse(sk_c5) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_24,136,theory(equality)]) ).
cnf(157,plain,
sk_c1 = multiply(inverse(sk_c8),identity),
inference('REWRITE',[status(thm)],[135,136,theory(equality)]) ).
cnf(158,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[43,left_inverse,theory(equality)]) ).
cnf(159,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[43,43,theory(equality)]) ).
cnf(160,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[158,159,theory(equality)]) ).
cnf(161,plain,
sk_c1 = inverse(sk_c8),
inference('REWRITE',[status(thm)],[157,160,theory(equality)]) ).
cnf(162,plain,
( multiply(sk_c1,sk_c7) = sk_c8
| sk_c1 = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_7,161,theory(equality)]) ).
cnf(163,plain,
( multiply(sk_c8,sk_c3) = sk_c7
| sk_c1 = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_13,161,theory(equality)]) ).
cnf(164,plain,
( sk_c1 != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8
| multiply(sk_c8,Y) != sk_c7
| multiply(Z,sk_c8) != Y
| inverse(Z) != sk_c8 ),
inference('REWRITE',[status(thm)],[35,161,theory(equality)]) ).
cnf(172,plain,
( sk_c1 != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8
| multiply(sk_c8,Y) != sk_c7
| identity != Y ),
inference('REWRITE',[status(thm)],[103,99,161,theory(equality)]) ).
cnf(192,plain,
( multiply(sk_c1,sk_c8) = sk_c3
| sk_c1 = sk_c7 ),
inference('REWRITE',[status(thm)],[137,161,theory(equality)]) ).
cnf(199,plain,
( inverse(sk_c5) = sk_c8
| sk_c3 = multiply(sk_c1,sk_c7) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,prove_this_18,theory(equality)]),161,theory(equality)]) ).
cnf(200,plain,
( inverse(sk_c4) = sk_c8
| sk_c3 = multiply(sk_c1,sk_c7) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,prove_this_14,theory(equality)]),161,theory(equality)]) ).
cnf(208,plain,
( multiply(sk_c8,sk_c3) = sk_c7
| sk_c8 = multiply(inverse(sk_c5),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_17,theory(equality)]) ).
cnf(212,plain,
( sk_c1 = sk_c7
| sk_c3 = multiply(sk_c1,sk_c7) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,163,theory(equality)]),161,theory(equality)]) ).
cnf(219,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,160,theory(equality)]) ).
cnf(223,plain,
multiply(sk_c1,sk_c8) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,161,theory(equality)]) ).
cnf(224,plain,
( identity = sk_c3
| inverse(sk_c4) = sk_c8 ),
inference('REWRITE',[status(thm)],[138,223,theory(equality)]) ).
cnf(225,plain,
( identity = sk_c3
| multiply(sk_c4,sk_c7) = sk_c8 ),
inference('REWRITE',[status(thm)],[139,223,theory(equality)]) ).
cnf(226,plain,
( identity = sk_c3
| multiply(sk_c8,sk_c6) = sk_c7 ),
inference('REWRITE',[status(thm)],[140,223,theory(equality)]) ).
cnf(227,plain,
( identity = sk_c3
| multiply(sk_c5,sk_c8) = sk_c6 ),
inference('REWRITE',[status(thm)],[141,223,theory(equality)]) ).
cnf(228,plain,
( identity = sk_c3
| inverse(sk_c5) = sk_c8 ),
inference('REWRITE',[status(thm)],[142,223,theory(equality)]) ).
cnf(233,plain,
( identity = sk_c3
| sk_c1 = sk_c7 ),
inference('REWRITE',[status(thm)],[192,223,theory(equality)]) ).
cnf(262,plain,
identity = sk_c3,
inference('HYPERRESOLVE',[status(thm)],[164,227,233,224,225,226,228]) ).
cnf(265,plain,
( sk_c7 = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_16,160,262,theory(equality)]) ).
cnf(267,plain,
( sk_c7 = sk_c8
| inverse(sk_c5) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_18,160,262,theory(equality)]) ).
cnf(281,plain,
( sk_c7 = sk_c8
| sk_c1 = sk_c7 ),
inference('REWRITE',[status(thm)],[163,160,262,theory(equality)]) ).
cnf(290,plain,
( inverse(sk_c5) = sk_c8
| identity = multiply(sk_c1,sk_c7) ),
inference('REWRITE',[status(thm)],[199,262,theory(equality)]) ).
cnf(291,plain,
( inverse(sk_c4) = sk_c8
| identity = multiply(sk_c1,sk_c7) ),
inference('REWRITE',[status(thm)],[200,262,theory(equality)]) ).
cnf(294,plain,
( sk_c7 = sk_c8
| sk_c8 = multiply(inverse(sk_c5),sk_c6) ),
inference('REWRITE',[status(thm)],[208,160,262,theory(equality)]) ).
cnf(295,plain,
( sk_c1 = sk_c7
| identity = multiply(sk_c1,sk_c7) ),
inference('REWRITE',[status(thm)],[212,262,theory(equality)]) ).
cnf(360,plain,
( sk_c1 = sk_c7
| identity = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[162,295,theory(equality)]) ).
cnf(363,plain,
( sk_c1 = sk_c7
| identity = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[281,360,theory(equality)]) ).
cnf(364,plain,
( sk_c1 = sk_c7
| sk_c1 = identity ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[161,360,theory(equality)]),219,theory(equality)]) ).
cnf(464,plain,
( inverse(sk_c5) = sk_c8
| identity = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[prove_this_12,290,theory(equality)]) ).
cnf(488,plain,
( inverse(sk_c4) = sk_c8
| identity = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[prove_this_8,291,theory(equality)]) ).
cnf(501,plain,
( identity = sk_c8
| identity = sk_c7
| multiply(sk_c1,sk_c7) = sk_c8 ),
inference('HYPERRESOLVE',[status(thm)],[164,488,363,prove_this_9,prove_this_10,prove_this_11,464]) ).
cnf(514,plain,
( sk_c7 = sk_c8
| sk_c8 = multiply(sk_c8,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[294,267,theory(equality)]) ).
cnf(518,plain,
sk_c7 = sk_c8,
inference('PARAMODULATE',[status(thm)],[265,514,theory(equality)]) ).
cnf(540,plain,
( sk_c1 != sk_c7
| inverse(X) != sk_c7
| multiply(X,sk_c7) != sk_c7
| multiply(sk_c7,Y) != sk_c7
| identity != Y ),
inference('REWRITE',[status(thm)],[172,518,theory(equality)]) ).
cnf(560,plain,
identity = multiply(sk_c1,sk_c7),
inference('REWRITE',[status(thm)],[223,518,theory(equality)]) ).
cnf(624,plain,
identity = sk_c7,
inference('REWRITE',[status(thm)],[501,560,518,theory(equality)]) ).
cnf(625,plain,
sk_c1 = identity,
inference('REWRITE',[status(thm)],[364,624,theory(equality)]) ).
cnf(631,plain,
( inverse(X) != identity
| X != identity ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[540,left_identity,160,625,624,theory(equality)])]) ).
cnf(635,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[631,219,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP229-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 07:23:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:23:41
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-06-14T07:23:41
% 0.21/0.49
% 0.21/0.49 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.21/0.49 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.61/0.81 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.61/0.81
% 0.61/0.81 #||
% 0.61/0.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.81 % SZS output start Refutation
% See solution above
% 0.61/0.82 ||#
% 0.61/0.82
% 0.61/0.82 ; Summary of computation:
% 0.61/0.82 ; 2420 formulas have been input or derived (from 115 formulas).
% 0.61/0.82 ; 635 (26%) were retained. Of these,
% 0.61/0.82 ; 605 (95%) were simplified or subsumed later,
% 0.61/0.82 ; 30 ( 5%) are still being kept.
% 0.61/0.82 ;
% 0.61/0.82 ; Run time in seconds excluding printing time:
% 0.61/0.82 ; 0.006 2% Read assertion file (1 call)
% 0.61/0.82 ; 0.002 1% Assert (34 calls)
% 0.61/0.82 ; 0.041 12% Process new row (1,912 calls)
% 0.61/0.82 ; 0.061 18% Resolution (228 calls)
% 0.61/0.82 ; 0.028 8% Paramodulation (114 calls)
% 0.61/0.82 ; 0.000 0% Factoring (86 calls)
% 0.61/0.82 ; 0.014 4% Condensing (989 calls)
% 0.61/0.82 ; 0.041 12% Forward subsumption (989 calls)
% 0.61/0.82 ; 0.018 5% Backward subsumption (569 calls)
% 0.61/0.82 ; 0.005 2% Clause clause subsumption (1,167 calls)
% 0.61/0.82 ; 0.048 15% Forward simplification (1,656 calls)
% 0.61/0.82 ; 0.020 6% Backward simplification (634 calls)
% 0.61/0.82 ; 0.016 5% Ordering (4,602 calls)
% 0.61/0.82 ; 0.001 0% Sortal reasoning (32 calls)
% 0.61/0.82 ; 0.000 0% Purity testing (1 call)
% 0.61/0.82 ; 0.029 9% Other
% 0.61/0.82 ; 0.330 Total
% 0.61/0.82 ; 0.343 Real time
% 0.61/0.82 ;
% 0.61/0.82 ; Term-hash-array has 471 terms in all.
% 0.61/0.82 ; Feature-vector-row-index has 2 entries (261 at peak, 569 added, 567 deleted).
% 0.61/0.82 ; Feature-vector-row-index has 9 nodes (1,509 at peak, 3,887 added, 3,878 deleted).
% 0.61/0.82 ; Retrieved 1,576 possibly forward subsuming rows in 989 calls.
% 0.61/0.82 ; Retrieved 318 possibly backward subsumed rows in 569 calls.
% 0.61/0.82 ; Path-index has 80 entries (329 at peak, 661 added, 581 deleted).
% 0.61/0.82 ; Path-index has 152 nodes (237 at peak, 383 added, 231 deleted).
% 0.61/0.82 ; Trie-index has 80 entries (329 at peak, 661 added, 581 deleted).
% 0.61/0.82 ; Trie-index has 229 nodes (699 at peak, 1,273 added, 1,044 deleted).
% 0.61/0.82 ; Retrieved 1,060 generalization terms in 7,552 calls.
% 0.61/0.82 ; Retrieved 87 instance terms in 76 calls.
% 0.61/0.82 ; Retrieved 31,638 unifiable terms in 2,324 calls.
% 0.61/0.82 ;
% 0.61/0.82 ; The agenda of rows to process has 19 entries:
% 0.61/0.82 ; 3 with value 8 3 with value 11 2 with value 15
% 0.61/0.82 ; 1 with value 9 4 with value 12 1 with value 16
% 0.61/0.82 ; 1 with value 10 3 with value 13 1 with value 17
% 0.61/0.82 ; The agenda of rows to give has 13 entries:
% 0.61/0.82 ; 2 with value (4 15) 2 with value (4 18) 7 with value (4 20)
% 0.61/0.82 ; 2 with value (4 17)
% 0.61/0.82 Evaluation took:
% 0.61/0.82 0.343 seconds of real time
% 0.61/0.82 0.312037 seconds of user run time
% 0.61/0.82 0.031115 seconds of system run time
% 0.61/0.82 [Run times include 0.011 seconds GC run time.]
% 0.61/0.82 0 calls to %EVAL
% 0.61/0.82 0 page faults and
% 0.61/0.82 27,345,016 bytes consed.
% 0.61/0.82 :PROOF-FOUND
% 0.61/0.82 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:23:41
% 0.61/0.82 :PROOF-FOUND
% 0.61/0.82 *
%------------------------------------------------------------------------------