TSTP Solution File: GRP413-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.0.
% 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:38:25 EDT 2022
% Result : Unsatisfiable 1.67s 1.92s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 2
% Syntax : Number of clauses : 79 ( 79 unt; 0 nHn; 5 RR)
% Number of literals : 79 ( 78 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 280 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(multiply(X,inverse(Y))),Z))),Y))) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(3,plain,
multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(Z)),Y))) = inverse(multiply(multiply(multiply(inverse(U),U),inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),inverse(U))),Z))),U)),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(Z)),Y)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(6,plain,
inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(inverse(multiply(Y,inverse(Z))),inverse(X))),multiply(inverse(multiply(Y,inverse(Z))),U)))),X)) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(24,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,Y)))) = multiply(multiply(multiply(inverse(U),U),inverse(multiply(inverse(multiply(multiply(inverse(Y),Y),inverse(U))),Z))),U),
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(32,plain,
inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,Z)))),X)) = Z,
inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).
cnf(33,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,Z)) = multiply(inverse(multiply(U,inverse(Y))),multiply(U,Z)),
inference('PARAMODULATE',[status(thm)],[5,32,theory(equality)]) ).
cnf(52,plain,
multiply(inverse(multiply(X,Y)),multiply(X,Z)) = multiply(inverse(multiply(U,Y)),multiply(U,Z)),
inference('PARAMODULATE',[status(thm)],[33,32,theory(equality)]) ).
cnf(53,plain,
multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(U,Y)),multiply(U,V))) = multiply(inverse(multiply(W,Z)),multiply(W,multiply(X,V))),
inference('PARAMODULATE',[status(thm)],[52,52,theory(equality)]) ).
cnf(54,plain,
multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(multiply(U,Y)),V)) = multiply(inverse(multiply(W,multiply(U,Z))),multiply(W,V)),
inference('PARAMODULATE',[status(thm)],[52,52,theory(equality)]) ).
cnf(123,plain,
multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,multiply(Y,U))) = multiply(inverse(multiply(V,multiply(W,Z))),multiply(V,multiply(W,U))),
inference('PARAMODULATE',[status(thm)],[53,54,theory(equality)]) ).
cnf(244,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,inverse(multiply(Z,X)))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,24,theory(equality)]) ).
cnf(245,plain,
inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),Z),Y))))) = Z,
inference('PARAMODULATE',[status(thm)],[32,24,theory(equality)]) ).
cnf(246,plain,
multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(multiply(inverse(Y),Y),inverse(X))),multiply(multiply(inverse(Y),Y),inverse(Z))))),X) = Z,
inference('PARAMODULATE',[status(thm)],[5,24,theory(equality)]) ).
cnf(324,plain,
multiply(multiply(inverse(multiply(X,Y)),multiply(X,Y)),inverse(multiply(inverse(multiply(Z,inverse(multiply(U,Y)))),multiply(Z,inverse(multiply(V,multiply(U,Y))))))) = V,
inference('PARAMODULATE',[status(thm)],[244,52,theory(equality)]) ).
cnf(329,plain,
multiply(multiply(inverse(multiply(X,Y)),multiply(X,Y)),inverse(multiply(inverse(multiply(Z,inverse(multiply(X,Y)))),multiply(Z,inverse(multiply(inverse(multiply(U,V)),multiply(U,Y))))))) = inverse(multiply(X,V)),
inference('PARAMODULATE',[status(thm)],[244,52,theory(equality)]) ).
cnf(355,plain,
inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))) = inverse(multiply(inverse(multiply(U,Y)),multiply(U,Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[244,54,theory(equality)]),329,theory(equality)]) ).
cnf(446,plain,
multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,inverse(Z))))),X) = Z,
inference('PARAMODULATE',[status(thm)],[246,52,theory(equality)]) ).
cnf(538,plain,
multiply(multiply(inverse(multiply(X,Y)),multiply(X,Y)),Z) = multiply(multiply(inverse(multiply(U,Y)),multiply(U,Y)),Z),
inference('PARAMODULATE',[status(thm)],[324,245,theory(equality)]) ).
cnf(540,plain,
multiply(multiply(inverse(X),X),Y) = multiply(multiply(inverse(multiply(Z,U)),multiply(Z,U)),Y),
inference('PARAMODULATE',[status(thm)],[538,446,theory(equality)]) ).
cnf(541,plain,
multiply(multiply(inverse(multiply(X,Y)),multiply(X,Y)),a2) != a2,
inference('PARAMODULATE',[status(thm)],[prove_these_axioms_2,540,theory(equality)]) ).
cnf(542,plain,
multiply(multiply(inverse(X),X),Y) = multiply(multiply(inverse(Z),Z),Y),
inference('PARAMODULATE',[status(thm)],[540,540,theory(equality)]) ).
cnf(543,plain,
multiply(multiply(inverse(X),X),a2) != a2,
inference('PARAMODULATE',[status(thm)],[541,446,theory(equality)]) ).
cnf(549,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(multiply(U,Z)))))) = U,
inference('PARAMODULATE',[status(thm)],[244,542,theory(equality)]) ).
cnf(550,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Z),Z),inverse(U)),Y)))) = U,
inference('PARAMODULATE',[status(thm)],[5,542,theory(equality)]) ).
cnf(551,plain,
multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(U))))),Z) = U,
inference('PARAMODULATE',[status(thm)],[446,542,theory(equality)]) ).
cnf(552,plain,
inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,U)))),Z)) = U,
inference('PARAMODULATE',[status(thm)],[32,542,theory(equality)]) ).
cnf(553,plain,
inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Z),Z),U),Y))))) = U,
inference('PARAMODULATE',[status(thm)],[245,542,theory(equality)]) ).
cnf(572,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[549,542,theory(equality)]),549,theory(equality)]) ).
cnf(603,plain,
inverse(multiply(inverse(X),X)) = inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,Z))),
inference('PARAMODULATE',[status(thm)],[355,572,theory(equality)]) ).
cnf(604,plain,
multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(Z),Z)) = multiply(inverse(multiply(U,Y)),multiply(U,X)),
inference('PARAMODULATE',[status(thm)],[52,572,theory(equality)]) ).
cnf(605,plain,
multiply(inverse(multiply(inverse(X),X)),multiply(inverse(Y),Z)) = multiply(inverse(multiply(U,Y)),multiply(U,Z)),
inference('PARAMODULATE',[status(thm)],[52,572,theory(equality)]) ).
cnf(611,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(inverse(inverse(multiply(Y,Z))),inverse(Z))),multiply(inverse(U),U)))) = Y,
inference('PARAMODULATE',[status(thm)],[549,572,theory(equality)]) ).
cnf(633,plain,
inverse(multiply(inverse(X),X)) = inverse(multiply(inverse(Y),Y)),
inference('PARAMODULATE',[status(thm)],[603,603,theory(equality)]) ).
cnf(634,plain,
multiply(inverse(X),X) = multiply(inverse(multiply(inverse(Y),Y)),multiply(inverse(Z),Z)),
inference('PARAMODULATE',[status(thm)],[572,633,theory(equality)]) ).
cnf(636,plain,
inverse(multiply(inverse(X),X)) = inverse(multiply(inverse(multiply(inverse(Y),Y)),multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[633,633,theory(equality)]) ).
cnf(669,plain,
multiply(inverse(multiply(X,multiply(inverse(Y),Z))),multiply(X,multiply(inverse(multiply(inverse(U),U)),multiply(inverse(V),V)))) = multiply(inverse(multiply(W,multiply(X1,Z))),multiply(W,multiply(X1,Y))),
inference('PARAMODULATE',[status(thm)],[123,634,theory(equality)]) ).
cnf(670,plain,
multiply(inverse(multiply(X,multiply(inverse(Y),Y))),multiply(X,multiply(inverse(multiply(inverse(Z),Z)),U))) = multiply(inverse(multiply(V,multiply(W,multiply(inverse(X1),X1)))),multiply(V,multiply(W,U))),
inference('PARAMODULATE',[status(thm)],[123,634,theory(equality)]) ).
cnf(711,plain,
multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(Z),Z)) = multiply(inverse(multiply(inverse(U),U)),multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[604,572,theory(equality)]) ).
cnf(712,plain,
multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(Z),Z)) = multiply(inverse(multiply(multiply(inverse(U),U),Y)),multiply(multiply(inverse(V),V),X)),
inference('PARAMODULATE',[status(thm)],[604,542,theory(equality)]) ).
cnf(900,plain,
multiply(inverse(multiply(inverse(X),X)),multiply(inverse(multiply(inverse(Y),Y)),Z)) = multiply(inverse(multiply(U,multiply(inverse(multiply(inverse(V),V)),multiply(inverse(W),W)))),multiply(U,Z)),
inference('PARAMODULATE',[status(thm)],[605,636,theory(equality)]) ).
cnf(913,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,Y)))) = multiply(inverse(multiply(U,inverse(V))),multiply(U,inverse(multiply(Z,V)))),
inference('PARAMODULATE',[status(thm)],[550,549,theory(equality)]) ).
cnf(922,plain,
multiply(inverse(multiply(inverse(multiply(inverse(X),X)),multiply(inverse(Y),Y))),multiply(inverse(inverse(Z)),inverse(multiply(multiply(multiply(inverse(U),U),inverse(V)),Z)))) = V,
inference('PARAMODULATE',[status(thm)],[550,634,theory(equality)]) ).
cnf(927,plain,
multiply(inverse(multiply(inverse(inverse(multiply(multiply(multiply(inverse(X),X),inverse(Y)),Z))),inverse(Z))),multiply(inverse(multiply(inverse(U),U)),multiply(inverse(V),V))) = Y,
inference('PARAMODULATE',[status(thm)],[550,634,theory(equality)]) ).
cnf(961,plain,
multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),Y))),Z) = Z,
inference('PARAMODULATE',[status(thm)],[551,572,theory(equality)]) ).
cnf(1017,plain,
multiply(inverse(X),Y) = multiply(inverse(multiply(Z,X)),multiply(Z,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,961,theory(equality)]),961,theory(equality)]) ).
cnf(1020,plain,
multiply(inverse(multiply(inverse(X),X)),multiply(inverse(multiply(inverse(Y),Y)),Z)) = multiply(inverse(multiply(inverse(multiply(inverse(U),U)),multiply(inverse(V),V))),Z),
inference('REWRITE',[status(thm)],[900,1017,theory(equality)]) ).
cnf(1052,plain,
multiply(inverse(multiply(inverse(X),X)),multiply(inverse(multiply(inverse(Y),Y)),Z)) = multiply(inverse(multiply(inverse(U),U)),Z),
inference('REWRITE',[status(thm)],[670,1017,theory(equality)]) ).
cnf(1054,plain,
multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(multiply(inverse(Z),Z)),multiply(inverse(U),U))) = multiply(inverse(Y),X),
inference('REWRITE',[status(thm)],[669,1017,theory(equality)]) ).
cnf(1056,plain,
multiply(inverse(inverse(X)),inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(Z)),X))) = Z,
inference('REWRITE',[status(thm)],[927,1054,theory(equality)]) ).
cnf(1057,plain,
multiply(inverse(multiply(inverse(multiply(inverse(X),X)),multiply(inverse(Y),Y))),Z) = Z,
inference('REWRITE',[status(thm)],[922,1056,theory(equality)]) ).
cnf(1058,plain,
multiply(inverse(multiply(inverse(X),X)),multiply(inverse(multiply(inverse(Y),Y)),Z)) = Z,
inference('REWRITE',[status(thm)],[1020,1057,theory(equality)]) ).
cnf(1060,plain,
X = multiply(inverse(multiply(inverse(Y),Y)),X),
inference('REWRITE',[status(thm)],[1052,1058,theory(equality)]) ).
cnf(1068,plain,
multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(Z),Z)) = multiply(inverse(Y),X),
inference('REWRITE',[status(thm)],[711,1060,theory(equality)]) ).
cnf(1070,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(inverse(Y)),inverse(multiply(Z,Y))))) = Z,
inference('REWRITE',[status(thm)],[611,1068,theory(equality)]) ).
cnf(1071,plain,
multiply(inverse(X),Y) = multiply(inverse(multiply(multiply(inverse(Z),Z),X)),multiply(multiply(inverse(U),U),Y)),
inference('REWRITE',[status(thm)],[712,1068,theory(equality)]) ).
cnf(1166,plain,
inverse(multiply(inverse(inverse(X)),inverse(multiply(multiply(multiply(inverse(Y),Y),Z),X)))) = Z,
inference('REWRITE',[status(thm)],[553,1017,theory(equality)]) ).
cnf(1197,plain,
inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(inverse(Y)),Z))),Y)) = Z,
inference('REWRITE',[status(thm)],[552,1017,theory(equality)]) ).
cnf(1216,plain,
multiply(inverse(inverse(X)),inverse(multiply(Y,X))) = multiply(inverse(inverse(Z)),inverse(multiply(Y,Z))),
inference('REWRITE',[status(thm)],[913,1017,theory(equality)]) ).
cnf(1431,plain,
multiply(inverse(inverse(X)),inverse(multiply(inverse(Y),Y))) = multiply(inverse(inverse(Z)),inverse(multiply(inverse(X),Z))),
inference('PARAMODULATE',[status(thm)],[1216,572,theory(equality)]) ).
cnf(1445,plain,
inverse(multiply(inverse(inverse(X)),inverse(multiply(Y,X)))) = inverse(multiply(inverse(inverse(Z)),inverse(multiply(Y,Z)))),
inference('PARAMODULATE',[status(thm)],[1166,1070,theory(equality)]) ).
cnf(1485,plain,
multiply(inverse(X),inverse(multiply(inverse(Y),Y))) = multiply(inverse(inverse(Z)),inverse(multiply(X,Z))),
inference('PARAMODULATE',[status(thm)],[1431,1197,theory(equality)]) ).
cnf(1486,plain,
multiply(inverse(X),inverse(multiply(inverse(Y),Y))) = multiply(inverse(X),inverse(multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[1485,1485,theory(equality)]) ).
cnf(1487,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),inverse(multiply(inverse(Z),Z))))) = Y,
inference('PARAMODULATE',[status(thm)],[1070,1485,theory(equality)]) ).
cnf(1488,plain,
inverse(multiply(inverse(multiply(multiply(inverse(X),X),Y)),inverse(multiply(inverse(Z),Z)))) = Y,
inference('PARAMODULATE',[status(thm)],[1166,1485,theory(equality)]) ).
cnf(1548,plain,
multiply(X,inverse(multiply(inverse(Y),Y))) = multiply(X,inverse(multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[1486,1197,theory(equality)]) ).
cnf(1550,plain,
multiply(multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(inverse(Y),Y))),a2) != a2,
inference('PARAMODULATE',[status(thm)],[543,1548,theory(equality)]) ).
cnf(1571,plain,
inverse(multiply(inverse(inverse(X)),inverse(multiply(multiply(multiply(inverse(inverse(multiply(inverse(Y),Y))),inverse(multiply(inverse(Z),Z))),U),X)))) = U,
inference('PARAMODULATE',[status(thm)],[1166,1548,theory(equality)]) ).
cnf(1660,plain,
inverse(multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(Y,multiply(inverse(Z),Z))))) = inverse(multiply(inverse(inverse(U)),inverse(multiply(Y,U)))),
inference('PARAMODULATE',[status(thm)],[1445,633,theory(equality)]) ).
cnf(1688,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),Y))) = inverse(multiply(inverse(Z),Z)),
inference('PARAMODULATE',[status(thm)],[1487,572,theory(equality)]) ).
cnf(1700,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),inverse(multiply(inverse(inverse(multiply(inverse(Z),Z))),inverse(multiply(inverse(U),U))))))) = Y,
inference('PARAMODULATE',[status(thm)],[1487,1548,theory(equality)]) ).
cnf(1730,plain,
multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(Z),Z)))),inverse(multiply(U,multiply(inverse(V),V)))))) = U,
inference('PARAMODULATE',[status(thm)],[1070,1688,theory(equality)]) ).
cnf(1742,plain,
inverse(multiply(inverse(X),inverse(multiply(inverse(Y),Y)))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1488,1688,theory(equality)]),1071,theory(equality)]) ).
cnf(1743,plain,
multiply(multiply(inverse(X),X),Y) = Y,
inference('REWRITE',[status(thm)],[1700,1742,theory(equality)]) ).
cnf(1746,plain,
inverse(multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(Y,multiply(inverse(Z),Z))))) = Y,
inference('REWRITE',[status(thm)],[1730,1743,theory(equality)]) ).
cnf(1747,plain,
X = inverse(multiply(inverse(inverse(Y)),inverse(multiply(X,Y)))),
inference('REWRITE',[status(thm)],[1660,1746,theory(equality)]) ).
cnf(1756,plain,
multiply(multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(inverse(Y),Y))),Z) = Z,
inference('REWRITE',[status(thm)],[1571,1747,theory(equality)]) ).
cnf(1758,plain,
$false,
inference('REWRITE',[status(thm)],[1550,1756,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 20:48:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 *
% 0.19/0.48 *
% 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-13T20:48:23
% 0.19/0.49 ; 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-13T20:48:23
% 1.67/1.92
% 1.67/1.92
% 1.67/1.92 #||
% 1.67/1.92 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.67/1.92 % SZS output start Refutation
% See solution above
% 1.75/1.92 ||#
% 1.75/1.92
% 1.75/1.92 ; Summary of computation:
% 1.75/1.92 ; 7677 formulas have been input or derived (from 62 formulas).
% 1.75/1.92 ; 1758 (23%) were retained. Of these,
% 1.75/1.92 ; 1549 (88%) were simplified or subsumed later,
% 1.75/1.92 ; 209 (12%) are still being kept.
% 1.75/1.92 ;
% 1.75/1.92 ; Run time in seconds excluding printing time:
% 1.75/1.92 ; 0.001 0% Read assertion file (1 call)
% 1.75/1.92 ; 0.000 0% Assert (2 calls)
% 1.75/1.92 ; 0.376 26% Process new row (7,084 calls)
% 1.75/1.92 ; 0.009 1% Resolution (122 calls)
% 1.75/1.92 ; 0.165 12% Paramodulation (61 calls)
% 1.75/1.92 ; 0.488 34% Forward simplification (5,765 calls)
% 1.75/1.92 ; 0.270 19% Backward simplification (1,758 calls)
% 1.75/1.92 ; 0.078 5% Ordering (13,713 calls)
% 1.75/1.92 ; 0.000 0% Sortal reasoning (32 calls)
% 1.75/1.95 ; 0.000 0% Purity testing (1 call)
% 1.75/1.95 ; 0.043 3% Other
% 1.75/1.95 ; 1.430 Total
% 1.75/1.95 ; 1.462 Real time
% 1.75/1.95 ;
% 1.75/1.95 ; Term-hash-array has 10,428 terms in all.
% 1.75/1.95 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.75/1.95 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.75/1.95 ; Path-index has 1,345 entries (6,177 at peak, 11,381 added, 10,036 deleted).
% 1.75/1.95 ; Path-index has 10,245 nodes (12,217 at peak, 16,384 added, 6,139 deleted).
% 1.75/1.95 ; Trie-index has 1,345 entries (6,177 at peak, 11,381 added, 10,036 deleted).
% 1.75/1.95 ; Trie-index has 5,136 nodes (40,210 at peak, 67,978 added, 62,842 deleted).
% 1.75/1.95 ; Retrieved 23,732 generalization terms in 75,931 calls.
% 1.75/1.95 ; Retrieved 11,768 instance terms in 2,009 calls.
% 1.75/1.95 ; Retrieved 67,370 unifiable terms in 753 calls.
% 1.75/1.95 ;
% 1.75/1.95 ; The agenda of backward simplifiable rows to process has 383 entries:
% 1.75/1.95 ; 383 with value 0
% 1.75/1.95 ; The agenda of rows to process has 103 entries:
% 1.75/1.95 ; 6 with value 45 11 with value 50 5 with value 54
% 1.75/1.95 ; 7 with value 46 4 with value 51 9 with value 55
% 1.75/1.95 ; 10 with value 47 16 with value 52 4 with value 56
% 1.75/1.95 ; 7 with value 48 12 with value 53 2 with value 61
% 1.75/1.95 ; 10 with value 49
% 1.75/1.95 ; The agenda of rows to give has 195 entries:
% 1.75/1.95 ; 1 with value (4 28) 11 with value (4 43) 9 with value (4 52)
% 1.75/1.95 ; 1 with value (4 30) 10 with value (4 44) 7 with value (4 53)
% 1.75/1.95 ; 2 with value (4 33) 16 with value (4 45) 7 with value (4 54)
% 1.75/1.95 ; 1 with value (4 34) 11 with value (4 46) 5 with value (4 55)
% 1.75/1.95 ; 2 with value (4 37) 5 with value (4 47) 5 with value (4 56)
% 1.75/1.95 ; 3 with value (4 38) 12 with value (4 48) 1 with value (4 57)
% 1.75/1.95 ; 7 with value (4 39) 21 with value (4 49) 2 with value (4 58)
% 1.75/1.95 ; 7 with value (4 40) 17 with value (4 50) 2 with value (4 59)
% 1.75/1.95 ; 6 with value (4 41) 14 with value (4 51) 1 with value (4 60)
% 1.75/1.95 ; 9 with value (4 42)
% 1.75/1.95 Evaluation took:
% 1.75/1.95 1.463 seconds of real time
% 1.75/1.95 1.385969 seconds of user run time
% 1.75/1.95 0.077056 seconds of system run time
% 1.75/1.95 [Run times include 0.169 seconds GC run time.]
% 1.75/1.95 0 calls to %EVAL
% 1.75/1.95 0 page faults and
% 1.75/1.95 113,259,048 bytes consed.
% 1.75/1.95 :PROOF-FOUND
% 1.75/1.95 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T20:48:24
% 1.75/1.95 :PROOF-FOUND
% 1.75/1.95 *
%------------------------------------------------------------------------------