TSTP Solution File: BOO071-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : BOO071-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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 : Thu Jul 14 23:49:06 EDT 2022
% Result : Unsatisfiable 3.87s 4.03s
% Output : Refutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 2 RR)
% Number of literals : 48 ( 47 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 347 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,U,V),W,multiply(Z,U,X1))),multiply(U,multiply(X1,W,V),Z)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_tba_axioms_5,negated_conjecture,
multiply(inverse(b),b,a) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_tba_axioms_5) ).
cnf(3,plain,
multiply(multiply(X,Y,Z),inverse(multiply(multiply(U,V,W),X1,multiply(U,V,Y1))),multiply(V,multiply(Y1,X1,W),U)) = multiply(Y,multiply(Z,inverse(multiply(X,Y,Z1)),Z1),X),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(4,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,U,multiply(V,multiply(W,X1,Y1),Z1)),inverse(multiply(multiply(Z1,V,Y1),X1,multiply(Z1,V,W))),multiply(Z,U,multiply(U1,inverse(U1),V1)))),multiply(U,V1,Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
multiply(inverse(X),multiply(Y,inverse(multiply(X,inverse(X),Z)),Z),X) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).
cnf(8,plain,
multiply(X,multiply(Y,inverse(multiply(Z,X,U)),U),Z) = multiply(X,multiply(Y,inverse(multiply(Z,X,V)),V),Z),
inference('PARAMODULATE',[status(thm)],[3,3,theory(equality)]) ).
cnf(38,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,inverse(Z),U),inverse(multiply(Z,inverse(Z),U)),multiply(Z,inverse(Z),V))),V) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,7,theory(equality)]) ).
cnf(40,plain,
multiply(multiply(X,Y,Z),inverse(multiply(multiply(U,inverse(U),V),inverse(multiply(U,inverse(U),V)),multiply(U,inverse(U),W))),W) = multiply(Y,multiply(Z,inverse(multiply(X,Y,X1)),X1),X),
inference('PARAMODULATE',[status(thm)],[3,7,theory(equality)]) ).
cnf(46,plain,
multiply(X,inverse(multiply(multiply(Y,Z,U),V,multiply(Y,Z,W))),multiply(Z,multiply(W,V,U),Y)) = multiply(multiply(X,inverse(multiply(X1,inverse(X1),Y1)),Y1),multiply(X1,inverse(multiply(inverse(X1),multiply(X,inverse(multiply(X1,inverse(X1),Y1)),Y1),Z1)),Z1),inverse(X1)),
inference('PARAMODULATE',[status(thm)],[3,7,theory(equality)]) ).
cnf(50,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,U,V),inverse(multiply(Z,U,V)),multiply(Z,U,W))),multiply(U,multiply(W,inverse(multiply(Z,U,X1)),X1),Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,8,theory(equality)]) ).
cnf(51,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,U,V),multiply(W,inverse(multiply(V,X1,Y1)),Y1),multiply(Z,U,X1))),multiply(U,multiply(X1,multiply(W,inverse(multiply(V,X1,Z1)),Z1),V),Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,8,theory(equality)]) ).
cnf(56,plain,
multiply(multiply(X,inverse(multiply(Y,inverse(Y),Z)),Z),multiply(U,inverse(X),Y),inverse(Y)) = multiply(multiply(X,inverse(multiply(Y,inverse(Y),Z)),Z),multiply(U,inverse(multiply(inverse(Y),multiply(X,inverse(multiply(Y,inverse(Y),Z)),Z),V)),V),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[8,7,theory(equality)]) ).
cnf(57,plain,
multiply(X,inverse(multiply(multiply(Y,Z,U),V,multiply(Y,Z,W))),multiply(Z,multiply(W,V,U),Y)) = multiply(multiply(X,inverse(multiply(X1,inverse(X1),Y1)),Y1),multiply(X1,inverse(X),X1),inverse(X1)),
inference('REWRITE',[status(thm)],[46,56,theory(equality)]) ).
cnf(72,plain,
multiply(inverse(multiply(multiply(X,inverse(X),Y),inverse(multiply(X,inverse(X),Y)),multiply(X,inverse(X),Z))),multiply(U,inverse(multiply(X,inverse(X),Z)),Z),multiply(multiply(X,inverse(X),Y),inverse(multiply(X,inverse(X),Y)),multiply(X,inverse(X),Z))) = U,
inference('PARAMODULATE',[status(thm)],[7,38,theory(equality)]) ).
cnf(145,plain,
multiply(inverse(multiply(multiply(X,Y,Z),inverse(multiply(X,Y,Z)),multiply(X,Y,U))),multiply(V,inverse(multiply(X,Y,U)),multiply(Y,multiply(U,inverse(multiply(X,Y,W)),W),X)),multiply(multiply(X,Y,Z),inverse(multiply(X,Y,Z)),multiply(X,Y,U))) = V,
inference('PARAMODULATE',[status(thm)],[7,50,theory(equality)]) ).
cnf(187,plain,
multiply(X,inverse(multiply(multiply(Y,inverse(Y),Z),inverse(multiply(Y,inverse(Y),Z)),multiply(Y,inverse(Y),U))),U) = multiply(multiply(X,inverse(multiply(V,inverse(V),W)),W),multiply(V,inverse(X),V),inverse(V)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[40,7,theory(equality)]),56,theory(equality)]) ).
cnf(253,plain,
multiply(X,inverse(multiply(multiply(Y,Z,U),V,multiply(Y,Z,W))),multiply(Z,multiply(W,V,U),Y)) = multiply(X,inverse(multiply(multiply(X1,Y1,Z1),U1,multiply(X1,Y1,V1))),multiply(Y1,multiply(V1,U1,Z1),X1)),
inference('PARAMODULATE',[status(thm)],[57,57,theory(equality)]) ).
cnf(262,plain,
multiply(X,inverse(multiply(multiply(Y,Z,multiply(U,multiply(V,W,X1),Y1)),inverse(multiply(multiply(Y1,U,X1),W,multiply(Y1,U,V))),multiply(Y,Z,multiply(Z1,inverse(Z1),U1)))),multiply(Z,U1,Y)) = multiply(multiply(X,inverse(multiply(V1,inverse(V1),W1)),W1),multiply(V1,inverse(X),V1),inverse(V1)),
inference('PARAMODULATE',[status(thm)],[57,single_axiom,theory(equality)]) ).
cnf(269,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(Z,inverse(Z),Z)),multiply(Z,inverse(multiply(multiply(U,V,W),X1,multiply(U,V,Y1))),multiply(V,multiply(Y1,X1,W),U))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,57,theory(equality)]),7,theory(equality)]) ).
cnf(362,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,inverse(multiply(multiply(U,V,W),X1,multiply(U,V,Y1))),multiply(V,multiply(Y1,X1,W),U)),inverse(multiply(Z,inverse(multiply(multiply(U,V,W),X1,multiply(U,V,Y1))),multiply(V,multiply(Y1,X1,W),U))),multiply(multiply(Z,inverse(multiply(Z1,inverse(Z1),U1)),U1),multiply(Z1,inverse(Z),Z1),V1))),multiply(multiply(Z1,inverse(Z),Z1),multiply(V1,inverse(multiply(multiply(Z,inverse(multiply(Z1,inverse(Z1),U1)),U1),multiply(Z1,inverse(Z),Z1),W1)),W1),multiply(Z,inverse(multiply(Z1,inverse(Z1),U1)),U1))) = Y,
inference('PARAMODULATE',[status(thm)],[50,57,theory(equality)]) ).
cnf(400,plain,
multiply(inverse(multiply(X,inverse(X),X)),multiply(Y,inverse(X),multiply(X,inverse(multiply(multiply(Z,U,V),W,multiply(Z,U,X1))),multiply(U,multiply(X1,W,V),Z))),multiply(X,inverse(X),X)) = Y,
inference('PARAMODULATE',[status(thm)],[7,269,theory(equality)]) ).
cnf(1071,plain,
multiply(X,inverse(multiply(multiply(Y,multiply(multiply(Z,U,V),inverse(multiply(multiply(Z,U,W),Y,X1)),X1),multiply(Z,U,W)),inverse(multiply(Y,multiply(multiply(Z,U,V),inverse(multiply(multiply(Z,U,W),Y,X1)),X1),multiply(Z,U,W))),multiply(multiply(multiply(Z,U,W),Y,multiply(Z,U,V)),inverse(multiply(multiply(Z,U,W),Y,multiply(Z,U,V))),Y1))),Y1) = multiply(multiply(X,inverse(multiply(Z1,inverse(Z1),U1)),U1),multiply(Z1,inverse(X),Z1),inverse(Z1)),
inference('PARAMODULATE',[status(thm)],[187,3,theory(equality)]) ).
cnf(1244,plain,
multiply(X,inverse(multiply(Y,Z,multiply(multiply(U,inverse(U),Y),inverse(multiply(multiply(V,W,X1),multiply(Y1,inverse(multiply(X1,Z1,U1)),U1),multiply(V,W,Z1))),V1))),multiply(inverse(multiply(multiply(V,W,X1),multiply(Y1,inverse(multiply(X1,Z1,U1)),U1),multiply(V,W,Z1))),multiply(V1,Z,multiply(W,multiply(Z1,multiply(Y1,inverse(multiply(X1,Z1,W1)),W1),X1),V)),multiply(U,inverse(U),Y))) = multiply(X,inverse(multiply(multiply(X2,Y2,Z2),U2,multiply(X2,Y2,V2))),multiply(Y2,multiply(V2,U2,Z2),X2)),
inference('PARAMODULATE',[status(thm)],[253,51,theory(equality)]) ).
cnf(1383,plain,
multiply(inverse(multiply(X,inverse(X),X)),multiply(Y,inverse(X),multiply(X,inverse(multiply(Z,U,multiply(multiply(V,inverse(V),Z),inverse(multiply(multiply(W,X1,Y1),multiply(Z1,inverse(multiply(Y1,U1,V1)),V1),multiply(W,X1,U1))),W1))),multiply(inverse(multiply(multiply(W,X1,Y1),multiply(Z1,inverse(multiply(Y1,U1,V1)),V1),multiply(W,X1,U1))),multiply(W1,U,multiply(X1,multiply(U1,multiply(Z1,inverse(multiply(Y1,U1,X2)),X2),Y1),W)),multiply(V,inverse(V),Z)))),multiply(X,inverse(X),X)) = Y,
inference('PARAMODULATE',[status(thm)],[400,51,theory(equality)]) ).
cnf(1480,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(Z,inverse(Z),multiply(U,inverse(U),V))),multiply(inverse(Z),V,Z)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,38,theory(equality)]),7,theory(equality)]) ).
cnf(1717,plain,
X = multiply(inverse(Y),X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1480,1480,theory(equality)]),1480,theory(equality)]) ).
cnf(1752,plain,
multiply(X,inverse(multiply(Y,Z,U)),multiply(Z,multiply(U,inverse(multiply(Y,Z,V)),V),Y)) = X,
inference('REWRITE',[status(thm)],[145,1717,theory(equality)]) ).
cnf(1779,plain,
multiply(X,inverse(multiply(Y,inverse(Y),Z)),Z) = X,
inference('REWRITE',[status(thm)],[72,1717,theory(equality)]) ).
cnf(2059,plain,
multiply(multiply(X,inverse(X),Y),inverse(multiply(multiply(Z,inverse(multiply(multiply(U,V,W),X1,multiply(U,V,Y1))),multiply(V,multiply(Y1,X1,W),U)),inverse(multiply(Z,inverse(multiply(multiply(U,V,W),X1,multiply(U,V,Y1))),multiply(V,multiply(Y1,X1,W),U))),multiply(Z,multiply(Z1,inverse(Z),Z1),U1))),multiply(multiply(Z1,inverse(Z),Z1),multiply(U1,inverse(multiply(Z,multiply(Z1,inverse(Z),Z1),V1)),V1),Z)) = Y,
inference('REWRITE',[status(thm)],[362,1779,theory(equality)]) ).
cnf(2215,plain,
multiply(X,inverse(multiply(multiply(Y,Z,multiply(U,multiply(V,W,X1),Y1)),inverse(multiply(multiply(Y1,U,X1),W,multiply(Y1,U,V))),multiply(Y,Z,multiply(Z1,inverse(Z1),U1)))),multiply(Z,U1,Y)) = multiply(X,multiply(V1,inverse(X),V1),inverse(V1)),
inference('REWRITE',[status(thm)],[262,1779,theory(equality)]) ).
cnf(2272,plain,
multiply(X,inverse(multiply(multiply(Y,multiply(multiply(Z,U,V),inverse(multiply(multiply(Z,U,W),Y,X1)),X1),multiply(Z,U,W)),inverse(multiply(Y,multiply(multiply(Z,U,V),inverse(multiply(multiply(Z,U,W),Y,X1)),X1),multiply(Z,U,W))),multiply(multiply(multiply(Z,U,W),Y,multiply(Z,U,V)),inverse(multiply(multiply(Z,U,W),Y,multiply(Z,U,V))),Y1))),Y1) = multiply(X,multiply(Z1,inverse(X),Z1),inverse(Z1)),
inference('REWRITE',[status(thm)],[1071,1779,theory(equality)]) ).
cnf(2519,plain,
multiply(X,inverse(Y),multiply(Y,inverse(multiply(Z,U,multiply(multiply(V,inverse(V),Z),inverse(multiply(multiply(W,X1,Y1),multiply(Z1,inverse(multiply(Y1,U1,V1)),V1),multiply(W,X1,U1))),W1))),multiply(inverse(multiply(multiply(W,X1,Y1),multiply(Z1,inverse(multiply(Y1,U1,V1)),V1),multiply(W,X1,U1))),multiply(W1,U,multiply(X1,multiply(U1,multiply(Z1,inverse(multiply(Y1,U1,X2)),X2),Y1),W)),multiply(V,inverse(V),Z)))) = X,
inference('REWRITE',[status(thm)],[1383,1717,theory(equality)]) ).
cnf(2711,plain,
multiply(inverse(inverse(X)),inverse(multiply(multiply(Y,Z,multiply(U,multiply(V,W,X1),Y1)),inverse(multiply(multiply(Y1,U,X1),W,multiply(Y1,U,V))),multiply(Y,Z,multiply(Z1,inverse(Z1),U1)))),multiply(Z,U1,Y)) = X,
inference('PARAMODULATE',[status(thm)],[4,1717,theory(equality)]) ).
cnf(2715,plain,
inverse(multiply(X,inverse(X),Y)) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[1717,1779,theory(equality)]) ).
cnf(2716,plain,
multiply(X,inverse(Y),Y) = multiply(X,multiply(Z,inverse(X),Z),inverse(Z)),
inference('REWRITE',[status(thm)],[2272,2715,theory(equality)]) ).
cnf(2717,plain,
multiply(X,inverse(X),Y) = Y,
inference('REWRITE',[status(thm)],[2059,1752,2715,theory(equality)]) ).
cnf(2738,plain,
multiply(X,inverse(multiply(Y,Z,multiply(Y,inverse(multiply(multiply(U,V,W),multiply(X1,inverse(multiply(W,Y1,Z1)),Z1),multiply(U,V,Y1))),U1))),multiply(inverse(multiply(multiply(U,V,W),multiply(X1,inverse(multiply(W,Y1,Z1)),Z1),multiply(U,V,Y1))),multiply(U1,Z,multiply(V,multiply(Y1,multiply(X1,inverse(multiply(W,Y1,V1)),V1),W),U)),Y)) = multiply(X,inverse(multiply(multiply(W1,X2,Y2),Z2,multiply(W1,X2,U2))),multiply(X2,multiply(U2,Z2,Y2),W1)),
inference('REWRITE',[status(thm)],[1244,2717,theory(equality)]) ).
cnf(2751,plain,
multiply(X,inverse(multiply(multiply(Y,Z,multiply(U,multiply(V,W,X1),Y1)),inverse(multiply(multiply(Y1,U,X1),W,multiply(Y1,U,V))),multiply(Y,Z,Z1))),multiply(Z,Z1,Y)) = multiply(X,multiply(U1,inverse(X),U1),inverse(U1)),
inference('REWRITE',[status(thm)],[2215,2717,theory(equality)]) ).
cnf(2753,plain,
multiply(inverse(inverse(X)),inverse(multiply(multiply(Y,Z,multiply(U,multiply(V,W,X1),Y1)),inverse(multiply(multiply(Y1,U,X1),W,multiply(Y1,U,V))),multiply(Y,Z,Z1))),multiply(Z,Z1,Y)) = X,
inference('REWRITE',[status(thm)],[2711,2717,theory(equality)]) ).
cnf(2798,plain,
multiply(X,inverse(Y),multiply(Y,inverse(multiply(Z,U,multiply(Z,inverse(multiply(multiply(V,W,X1),multiply(Y1,inverse(multiply(X1,Z1,U1)),U1),multiply(V,W,Z1))),V1))),multiply(inverse(multiply(multiply(V,W,X1),multiply(Y1,inverse(multiply(X1,Z1,U1)),U1),multiply(V,W,Z1))),multiply(V1,U,multiply(W,multiply(Z1,multiply(Y1,inverse(multiply(X1,Z1,W1)),W1),X1),V)),Z))) = X,
inference('REWRITE',[status(thm)],[2519,2717,theory(equality)]) ).
cnf(2804,plain,
multiply(X,inverse(multiply(multiply(Y,Z,U),V,multiply(Y,Z,W))),multiply(Z,multiply(W,V,U),Y)) = X,
inference('REWRITE',[status(thm)],[single_axiom,2717,theory(equality)]) ).
cnf(2806,plain,
multiply(X,inverse(multiply(Y,Z,multiply(Y,inverse(multiply(multiply(U,V,W),multiply(X1,inverse(multiply(W,Y1,Z1)),Z1),multiply(U,V,Y1))),U1))),multiply(inverse(multiply(multiply(U,V,W),multiply(X1,inverse(multiply(W,Y1,Z1)),Z1),multiply(U,V,Y1))),multiply(U1,Z,multiply(V,multiply(Y1,multiply(X1,inverse(multiply(W,Y1,V1)),V1),W),U)),Y)) = X,
inference('REWRITE',[status(thm)],[2738,2804,theory(equality)]) ).
cnf(2807,plain,
multiply(X,inverse(Y),Y) = X,
inference('REWRITE',[status(thm)],[2798,2806,theory(equality)]) ).
cnf(2808,plain,
X = multiply(X,multiply(Y,inverse(X),Y),inverse(Y)),
inference('REWRITE',[status(thm)],[2716,2807,theory(equality)]) ).
cnf(2861,plain,
multiply(X,inverse(multiply(multiply(Y,Z,multiply(U,multiply(V,W,X1),Y1)),inverse(multiply(multiply(Y1,U,X1),W,multiply(Y1,U,V))),multiply(Y,Z,Z1))),multiply(Z,Z1,Y)) = X,
inference('REWRITE',[status(thm)],[2751,2808,theory(equality)]) ).
cnf(2862,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[2753,2861,theory(equality)]) ).
cnf(3038,plain,
multiply(inverse(X),X,Y) = Y,
inference('PARAMODULATE',[status(thm)],[2717,2862,theory(equality)]) ).
cnf(3045,plain,
$false,
inference('REWRITE',[status(thm)],[prove_tba_axioms_5,3038,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO071-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n026.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 : Wed Jun 1 19:14:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-01T19:14:12
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-01T19:14:12
% 3.87/4.03
% 3.87/4.03
% 3.87/4.03 #||
% 3.87/4.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.87/4.03 % SZS output start Refutation
% See solution above
% 3.87/4.05 ||#
% 3.87/4.05
% 3.87/4.05 ; Summary of computation:
% 3.87/4.05 ; 5875 formulas have been input or derived (from 32 formulas).
% 3.87/4.05 ; 3045 (52%) were retained. Of these,
% 3.87/4.05 ; 2901 (95%) were simplified or subsumed later,
% 3.87/4.05 ; 144 ( 5%) are still being kept.
% 3.87/4.05 ;
% 3.87/4.05 ; Run time in seconds excluding printing time:
% 3.87/4.05 ; 0.001 0% Read assertion file (1 call)
% 3.87/4.05 ; 0.000 0% Assert (2 calls)
% 3.87/4.05 ; 0.881 25% Process new row (5,836 calls)
% 3.87/4.05 ; 0.007 0% Resolution (62 calls)
% 3.87/4.05 ; 0.234 7% Paramodulation (31 calls)
% 3.87/4.05 ; 1.274 36% Forward simplification (5,604 calls)
% 3.87/4.05 ; 0.939 26% Backward simplification (3,045 calls)
% 3.87/4.05 ; 0.164 5% Ordering (16,075 calls)
% 3.87/4.05 ; 0.000 0% Sortal reasoning (32 calls)
% 3.87/4.05 ; 0.000 0% Purity testing (1 call)
% 3.87/4.05 ; 0.049 1% Other
% 3.87/4.05 ; 3.549 Total
% 3.87/4.05 ; 3.565 Real time
% 3.87/4.05 ;
% 3.87/4.05 ; Term-hash-array has 16,965 terms in all.
% 3.87/4.05 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 3.87/4.05 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 3.87/4.05 ; Path-index has 1,167 entries (10,932 at peak, 18,449 added, 17,282 deleted).
% 3.87/4.05 ; Path-index has 20,041 nodes (29,580 at peak, 34,207 added, 14,166 deleted).
% 3.87/4.05 ; Trie-index has 1,167 entries (10,932 at peak, 18,449 added, 17,282 deleted).
% 3.87/4.05 ; Trie-index has 11,408 nodes (176,495 at peak, 262,233 added, 250,825 deleted).
% 3.87/4.05 ; Retrieved 44,362 generalization terms in 100,983 calls.
% 3.87/4.05 ; Retrieved 11,662 instance terms in 3,064 calls.
% 3.87/4.05 ; Retrieved 46,464 unifiable terms in 404 calls.
% 3.87/4.05 ;
% 3.87/4.05 ; The agenda of rows to process has 1 entry:
% 3.87/4.05 ; 1 with value 17
% 3.87/4.05 ; The agenda of rows to give has 139 entries:
% 3.87/4.05 ; 2 with value (4 16) 1 with value (4 42) 1 with value (4 65)
% 3.87/4.05 ; 1 with value (4 17) 1 with value (4 44) 1 with value (4 66)
% 3.87/4.05 ; 2 with value (4 20) 5 with value (4 45) 3 with value (4 67)
% 3.87/4.05 ; 1 with value (4 22) 2 with value (4 46) 1 with value (4 69)
% 3.87/4.05 ; 1 with value (4 23) 5 with value (4 47) 3 with value (4 70)
% 3.87/4.05 ; 2 with value (4 24) 3 with value (4 48) 4 with value (4 71)
% 3.87/4.05 ; 3 with value (4 25) 4 with value (4 49) 2 with value (4 72)
% 3.87/4.05 ; 2 with value (4 26) 3 with value (4 50) 1 with value (4 73)
% 3.87/4.05 ; 2 with value (4 29) 3 with value (4 51) 3 with value (4 74)
% 3.87/4.05 ; 6 with value (4 30) 1 with value (4 52) 1 with value (4 75)
% 3.87/4.05 ; 3 with value (4 31) 2 with value (4 53) 1 with value (4 76)
% 3.87/4.05 ; 2 with value (4 32) 2 with value (4 54) 1 with value (4 77)
% 3.87/4.05 ; 3 with value (4 33) 5 with value (4 55) 1 with value (4 80)
% 3.87/4.05 ; 2 with value (4 35) 1 with value (4 56) 1 with value (4 81)
% 3.87/4.05 ; 1 with value (4 36) 4 with value (4 57) 3 with value (4 86)
% 3.87/4.05 ; 3 with value (4 37) 3 with value (4 59) 4 with value (4 88)
% 3.87/4.05 ; 3 with value (4 38) 2 with value (4 60) 1 with value (4 90)
% 3.87/4.05 ; 3 with value (4 39) 1 with value (4 61) 1 with value (4 96)
% 3.87/4.05 ; 5 with value (4 40) 4 with value (4 62) 2 with value (4 98)
% 3.87/4.05 ; 1 with value (4 41) 2 with value (4 64) 2 with value (4 101)
% 3.87/4.05 Evaluation took:
% 3.87/4.05 3.566 seconds of real time
% 3.87/4.05 3.321338 seconds of user run time
% 3.87/4.05 0.243884 seconds of system run time
% 3.87/4.05 [Run times include 0.737 seconds GC run time.]
% 3.87/4.05 0 calls to %EVAL
% 3.87/4.05 0 page faults and
% 3.87/4.05 261,696,152 bytes consed.
% 3.87/4.05 :PROOF-FOUND
% 3.87/4.05 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-01T19:14:15
% 3.87/4.05 :PROOF-FOUND
% 3.87/4.05 *
%------------------------------------------------------------------------------