TSTP Solution File: GRP201-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP201-1 : TPTP v8.1.0. Released v2.2.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 : Sat Jul 16 11:37:31 EDT 2022
% Result : Unsatisfiable 1.73s 1.95s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of clauses : 84 ( 84 unt; 0 nHn; 5 RR)
% Number of literals : 84 ( 83 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 145 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
cnf(right_identity,axiom,
multiply(X,identity) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
cnf(multiply_left_division,axiom,
multiply(X,left_division(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_left_division) ).
cnf(left_division_multiply,axiom,
left_division(X,multiply(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_division_multiply) ).
cnf(multiply_right_division,axiom,
multiply(right_division(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_right_division) ).
cnf(right_division_multiply,axiom,
right_division(multiply(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_division_multiply) ).
cnf(right_inverse,axiom,
multiply(X,right_inverse(X)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
cnf(left_inverse,axiom,
multiply(left_inverse(X),X) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(moufang2,axiom,
multiply(multiply(multiply(X,Y),Z),Y) = multiply(X,multiply(Y,multiply(Z,Y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',moufang2) ).
cnf(prove_moufang3,negated_conjecture,
multiply(multiply(multiply(a,b),a),c) != multiply(a,multiply(b,multiply(a,c))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_moufang3) ).
cnf(14,plain,
left_division(X,X) = identity,
inference('PARAMODULATE',[status(thm)],[left_division_multiply,right_identity,theory(equality)]) ).
cnf(15,plain,
left_division(X,identity) = right_inverse(X),
inference('PARAMODULATE',[status(thm)],[left_division_multiply,right_inverse,theory(equality)]) ).
cnf(16,plain,
right_inverse(left_inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[left_division_multiply,left_inverse,theory(equality)]),15,theory(equality)]) ).
cnf(18,plain,
left_division(right_division(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[left_division_multiply,multiply_right_division,theory(equality)]) ).
cnf(20,plain,
right_division(identity,X) = left_inverse(X),
inference('PARAMODULATE',[status(thm)],[right_division_multiply,left_inverse,theory(equality)]) ).
cnf(22,plain,
right_division(X,left_division(Y,X)) = Y,
inference('PARAMODULATE',[status(thm)],[right_division_multiply,multiply_left_division,theory(equality)]) ).
cnf(23,plain,
multiply(multiply(X,Y),X) = multiply(X,multiply(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[left_identity,moufang2,theory(equality)]),left_identity,theory(equality)]) ).
cnf(24,plain,
multiply(multiply(X,Y),Y) = multiply(X,multiply(Y,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[moufang2,right_identity,theory(equality)]),left_identity,theory(equality)]) ).
cnf(25,plain,
multiply(X,Y) = multiply(left_inverse(Y),multiply(Y,multiply(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[moufang2,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(26,plain,
multiply(multiply(multiply(X,Y),left_inverse(Y)),Y) = multiply(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[moufang2,left_inverse,theory(equality)]),right_identity,theory(equality)]) ).
cnf(43,plain,
X = multiply(X,multiply(right_inverse(X),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[23,right_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(53,plain,
multiply(multiply(a,multiply(b,a)),c) != multiply(a,multiply(b,multiply(a,c))),
inference('PARAMODULATE',[status(thm)],[prove_moufang3,23,theory(equality)]) ).
cnf(72,plain,
identity = multiply(right_inverse(X),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[left_division_multiply,43,theory(equality)]),14,theory(equality)]) ).
cnf(73,plain,
left_inverse(X) = right_inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[right_division_multiply,72,theory(equality)]),20,theory(equality)]) ).
cnf(74,plain,
left_inverse(left_inverse(X)) = X,
inference('REWRITE',[status(thm)],[16,73,theory(equality)]) ).
cnf(78,plain,
left_division(X,identity) = left_inverse(X),
inference('REWRITE',[status(thm)],[15,73,theory(equality)]) ).
cnf(79,plain,
X = multiply(left_inverse(X),multiply(X,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(80,plain,
multiply(X,Y) = multiply(right_division(X,Y),multiply(Y,Y)),
inference('PARAMODULATE',[status(thm)],[24,multiply_right_division,theory(equality)]) ).
cnf(106,plain,
left_division(left_inverse(X),X) = multiply(X,X),
inference('PARAMODULATE',[status(thm)],[left_division_multiply,79,theory(equality)]) ).
cnf(119,plain,
multiply(X,Y) = multiply(right_division(X,Y),left_division(left_inverse(Y),Y)),
inference('REWRITE',[status(thm)],[80,106,theory(equality)]) ).
cnf(138,plain,
X = multiply(left_inverse(Y),multiply(Y,X)),
inference('PARAMODULATE',[status(thm)],[25,multiply_right_division,theory(equality)]) ).
cnf(140,plain,
left_division(left_inverse(X),Y) = multiply(X,Y),
inference('PARAMODULATE',[status(thm)],[left_division_multiply,138,theory(equality)]) ).
cnf(141,plain,
left_division(left_inverse(X),left_division(X,Y)) = Y,
inference('REWRITE',[status(thm)],[multiply_left_division,140,theory(equality)]) ).
cnf(154,plain,
left_division(left_inverse(right_division(X,Y)),Y) = X,
inference('REWRITE',[status(thm)],[multiply_right_division,140,theory(equality)]) ).
cnf(156,plain,
left_division(left_inverse(left_division(left_inverse(left_division(left_inverse(X),Y)),Z)),Y) = left_division(left_inverse(X),left_division(left_inverse(Y),left_division(left_inverse(Z),Y))),
inference('REWRITE',[status(thm)],[moufang2,140,theory(equality)]) ).
cnf(157,plain,
left_division(left_inverse(left_division(left_inverse(X),Y)),X) = left_division(left_inverse(X),left_division(left_inverse(Y),X)),
inference('REWRITE',[status(thm)],[23,140,theory(equality)]) ).
cnf(158,plain,
left_division(left_inverse(left_division(left_inverse(left_division(left_inverse(X),Y)),left_inverse(Y))),Y) = left_division(left_inverse(X),Y),
inference('REWRITE',[status(thm)],[26,140,theory(equality)]) ).
cnf(191,plain,
left_division(left_inverse(X),Y) = left_division(left_inverse(right_division(X,Y)),left_division(left_inverse(Y),Y)),
inference('REWRITE',[status(thm)],[119,140,theory(equality)]) ).
cnf(203,plain,
left_division(left_inverse(left_division(left_inverse(left_division(left_inverse(a),b)),a)),c) != left_division(left_inverse(a),left_division(left_inverse(b),left_division(left_inverse(a),c))),
inference('REWRITE',[status(thm)],[53,157,140,theory(equality)]) ).
cnf(204,plain,
right_division(left_division(X,Y),Y) = left_inverse(X),
inference('PARAMODULATE',[status(thm)],[22,141,theory(equality)]) ).
cnf(205,plain,
right_division(X,Y) = left_inverse(right_division(Y,X)),
inference('PARAMODULATE',[status(thm)],[22,154,theory(equality)]) ).
cnf(208,plain,
left_division(left_inverse(X),Y) = left_division(right_division(Y,X),left_division(left_inverse(Y),Y)),
inference('REWRITE',[status(thm)],[191,205,theory(equality)]) ).
cnf(209,plain,
left_division(left_inverse(left_division(left_inverse(left_division(X,Y)),Z)),Y) = left_division(X,left_division(left_inverse(Y),left_division(left_inverse(Z),Y))),
inference('PARAMODULATE',[status(thm)],[156,74,theory(equality)]) ).
cnf(210,plain,
left_division(right_division(X,Y),left_division(right_division(Y,X),Z)) = Z,
inference('PARAMODULATE',[status(thm)],[141,205,theory(equality)]) ).
cnf(211,plain,
right_division(left_division(left_inverse(X),X),left_division(left_inverse(Y),X)) = right_division(X,Y),
inference('PARAMODULATE',[status(thm)],[22,208,theory(equality)]) ).
cnf(212,plain,
left_division(left_inverse(left_division(X,Y)),Y) = left_division(X,left_division(left_inverse(Y),Y)),
inference('PARAMODULATE',[status(thm)],[208,22,theory(equality)]) ).
cnf(213,plain,
left_division(right_division(X,Y),left_division(left_inverse(X),Y)) = left_division(left_inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[210,208,theory(equality)]) ).
cnf(214,plain,
right_division(left_division(left_inverse(X),Y),left_division(left_inverse(Y),Y)) = right_division(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[204,208,theory(equality)]),205,theory(equality)]) ).
cnf(217,plain,
right_division(left_division(left_inverse(X),X),left_division(Y,X)) = right_division(X,left_inverse(Y)),
inference('PARAMODULATE',[status(thm)],[211,74,theory(equality)]) ).
cnf(220,plain,
right_division(left_division(X,left_division(left_inverse(Y),Y)),Y) = left_division(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[204,212,theory(equality)]),74,theory(equality)]) ).
cnf(229,plain,
right_division(left_division(X,Y),left_division(left_inverse(Y),Y)) = right_division(left_inverse(X),Y),
inference('PARAMODULATE',[status(thm)],[214,74,theory(equality)]) ).
cnf(254,plain,
right_division(left_inverse(X),X) = left_division(X,left_inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[213,14,theory(equality)]),74,205,78,theory(equality)]) ).
cnf(263,plain,
right_division(X,left_inverse(X)) = left_division(left_inverse(X),X),
inference('PARAMODULATE',[status(thm)],[254,74,theory(equality)]) ).
cnf(265,plain,
left_division(left_inverse(X),X) = left_inverse(left_division(X,left_inverse(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[205,254,theory(equality)]),263,theory(equality)]) ).
cnf(270,plain,
left_division(X,left_inverse(X)) = left_inverse(left_division(left_inverse(X),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[205,263,theory(equality)]),254,theory(equality)]) ).
cnf(299,plain,
right_division(left_division(X,left_inverse(X)),left_division(Y,left_inverse(X))) = right_division(left_inverse(X),left_inverse(Y)),
inference('PARAMODULATE',[status(thm)],[217,74,theory(equality)]) ).
cnf(306,plain,
right_division(left_division(left_division(left_inverse(X),X),left_division(X,left_inverse(X))),left_division(Y,left_division(X,left_inverse(X)))) = right_division(left_division(X,left_inverse(X)),left_inverse(Y)),
inference('PARAMODULATE',[status(thm)],[217,265,theory(equality)]) ).
cnf(327,plain,
right_division(X,Y) = left_division(right_division(left_division(left_inverse(Y),Y),X),Y),
inference('PARAMODULATE',[status(thm)],[220,18,theory(equality)]) ).
cnf(338,plain,
right_division(left_division(X,left_inverse(Y)),left_division(Y,left_inverse(Y))) = right_division(left_inverse(X),left_inverse(Y)),
inference('PARAMODULATE',[status(thm)],[229,74,theory(equality)]) ).
cnf(347,plain,
right_division(left_division(X,left_division(Y,left_inverse(Y))),left_division(left_division(left_inverse(Y),Y),left_division(Y,left_inverse(Y)))) = right_division(left_inverse(X),left_division(Y,left_inverse(Y))),
inference('PARAMODULATE',[status(thm)],[229,265,theory(equality)]) ).
cnf(383,plain,
left_division(left_division(X,left_inverse(X)),left_division(left_inverse(X),X)) = left_inverse(left_division(left_division(left_inverse(X),X),left_division(X,left_inverse(X)))),
inference('PARAMODULATE',[status(thm)],[265,270,theory(equality)]) ).
cnf(563,plain,
right_division(X,left_inverse(Y)) = left_division(right_division(left_division(Y,left_inverse(Y)),X),left_inverse(Y)),
inference('PARAMODULATE',[status(thm)],[327,74,theory(equality)]) ).
cnf(848,plain,
left_division(left_inverse(left_division(left_inverse(left_division(X,Y)),left_inverse(Y))),Y) = left_division(X,Y),
inference('PARAMODULATE',[status(thm)],[158,74,theory(equality)]) ).
cnf(849,plain,
left_division(left_inverse(left_division(left_inverse(X),left_inverse(Y))),Y) = X,
inference('PARAMODULATE',[status(thm)],[848,18,theory(equality)]) ).
cnf(855,plain,
right_division(X,Y) = left_inverse(left_division(left_inverse(Y),left_inverse(X))),
inference('PARAMODULATE',[status(thm)],[22,849,theory(equality)]) ).
cnf(933,plain,
left_inverse(left_division(left_division(left_division(X,left_inverse(X)),left_division(left_inverse(X),X)),left_inverse(left_division(Y,left_division(X,left_inverse(X)))))) = left_inverse(left_division(left_division(left_inverse(X),X),Y)),
inference('REWRITE',[status(thm)],[347,74,265,383,855,theory(equality)]) ).
cnf(1077,plain,
left_inverse(left_division(left_inverse(left_division(X,left_division(Y,left_inverse(Y)))),left_division(left_division(Y,left_inverse(Y)),left_division(left_inverse(Y),Y)))) = left_inverse(left_division(X,left_division(left_inverse(Y),Y))),
inference('REWRITE',[status(thm)],[306,265,74,383,855,theory(equality)]) ).
cnf(1078,plain,
left_inverse(left_division(left_inverse(left_division(X,left_inverse(Y))),left_division(left_inverse(Y),Y))) = left_inverse(left_division(X,Y)),
inference('REWRITE',[status(thm)],[299,74,265,855,theory(equality)]) ).
cnf(1079,plain,
left_inverse(left_division(left_division(left_inverse(X),X),left_inverse(left_division(Y,left_inverse(X))))) = left_inverse(left_division(X,Y)),
inference('REWRITE',[status(thm)],[338,74,265,855,theory(equality)]) ).
cnf(1117,plain,
left_inverse(left_division(X,left_inverse(Y))) = left_division(left_inverse(left_division(left_inverse(Y),left_division(left_inverse(X),X))),left_inverse(X)),
inference('REWRITE',[status(thm)],[563,265,74,855,theory(equality)]) ).
cnf(1134,plain,
left_inverse(left_division(left_inverse(X),left_inverse(left_division(Y,left_division(left_inverse(X),X))))) = left_division(Y,X),
inference('REWRITE',[status(thm)],[220,855,theory(equality)]) ).
cnf(1221,plain,
left_inverse(left_division(left_inverse(X),left_inverse(Y))) = left_division(left_inverse(Y),left_inverse(X)),
inference('REWRITE',[status(thm)],[205,74,855,theory(equality)]) ).
cnf(1234,plain,
left_division(left_inverse(left_division(X,left_division(left_inverse(Y),Y))),left_inverse(Y)) = left_division(X,Y),
inference('REWRITE',[status(thm)],[1134,1221,theory(equality)]) ).
cnf(1235,plain,
left_inverse(left_division(X,left_inverse(Y))) = left_division(left_inverse(Y),X),
inference('REWRITE',[status(thm)],[1117,1234,theory(equality)]) ).
cnf(1241,plain,
left_division(left_inverse(left_division(X,left_division(Y,left_inverse(Y)))),left_division(left_division(Y,left_inverse(Y)),left_division(left_inverse(Y),Y))) = left_inverse(left_division(left_division(left_inverse(Y),Y),X)),
inference('REWRITE',[status(thm)],[933,1235,theory(equality)]) ).
cnf(1242,plain,
left_division(left_division(left_inverse(X),X),Y) = left_inverse(left_division(Y,left_division(left_inverse(X),X))),
inference('REWRITE',[status(thm)],[1077,74,1241,theory(equality)]) ).
cnf(1328,plain,
left_inverse(left_division(left_division(left_inverse(X),X),left_division(left_inverse(X),Y))) = left_inverse(left_division(X,Y)),
inference('REWRITE',[status(thm)],[1079,1235,theory(equality)]) ).
cnf(1373,plain,
left_division(left_division(left_inverse(X),X),left_division(left_inverse(X),Y)) = left_inverse(left_division(Y,X)),
inference('REWRITE',[status(thm)],[1078,1242,1235,theory(equality)]) ).
cnf(1374,plain,
left_division(X,Y) = left_inverse(left_division(Y,X)),
inference('REWRITE',[status(thm)],[1328,74,1373,theory(equality)]) ).
cnf(1423,plain,
left_division(left_division(X,left_division(Y,Z)),Y) = left_division(Z,left_division(left_inverse(Y),left_division(left_inverse(X),Y))),
inference('REWRITE',[status(thm)],[209,1374,theory(equality)]) ).
cnf(1569,plain,
left_division(left_division(a,left_division(b,left_inverse(a))),c) != left_division(left_inverse(a),left_division(left_inverse(b),left_division(left_inverse(a),c))),
inference('REWRITE',[status(thm)],[203,1374,theory(equality)]) ).
cnf(2212,plain,
left_division(left_division(left_inverse(X),left_division(Y,Z)),Y) = left_division(Z,left_division(left_inverse(Y),left_division(X,Y))),
inference('PARAMODULATE',[status(thm)],[1423,74,theory(equality)]) ).
cnf(2488,plain,
left_division(X,left_division(left_inverse(Y),left_division(X,Z))) = left_division(left_division(left_inverse(X),left_division(Y,X)),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1374,2212,theory(equality)]),1374,theory(equality)]) ).
cnf(2489,plain,
$false,
inference('REWRITE',[status(thm)],[1569,74,2488,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP201-1 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 06:27:20 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T06:27:21
% 0.20/0.49 ; 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-13T06:27:21
% 0.20/0.50
% 0.20/0.50 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.20/0.50 ; Recognized right identity assertion (= (|multiply| ?X |identity|) ?X).
% 0.20/0.50 ; Recognized possible right inverse assertion (= (|multiply| ?X (|right_inverse| ?X)) |identity|).
% 1.73/1.95 ; Recognized possible left inverse assertion (= (|multiply| (|left_inverse| ?X) ?X) |identity|).
% 1.73/1.95
% 1.73/1.95 #||
% 1.73/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.73/1.95 % SZS output start Refutation
% See solution above
% 1.81/1.99 ||#
% 1.81/1.99
% 1.81/1.99 ; Summary of computation:
% 1.81/1.99 ; 8235 formulas have been input or derived (from 144 formulas).
% 1.81/1.99 ; 2489 (30%) were retained. Of these,
% 1.81/1.99 ; 1555 (62%) were simplified or subsumed later,
% 1.81/1.99 ; 934 (38%) are still being kept.
% 1.81/1.99 ;
% 1.81/1.99 ; Run time in seconds excluding printing time:
% 1.81/1.99 ; 0.002 0% Read assertion file (1 call)
% 1.81/1.99 ; 0.000 0% Assert (10 calls)
% 1.81/1.99 ; 0.257 18% Process new row (7,893 calls)
% 1.81/1.99 ; 0.005 0% Resolution (286 calls)
% 1.81/1.99 ; 0.129 9% Paramodulation (143 calls)
% 1.81/1.99 ; 0.501 34% Forward simplification (7,440 calls)
% 1.81/1.99 ; 0.205 14% Backward simplification (2,489 calls)
% 1.81/1.99 ; 0.307 21% Ordering (39,495 calls)
% 1.81/1.99 ; 0.001 0% Sortal reasoning (32 calls)
% 1.81/1.99 ; 0.000 0% Purity testing (1 call)
% 1.81/1.99 ; 0.056 4% Other
% 1.81/1.99 ; 1.463 Total
% 1.81/1.99 ; 1.496 Real time
% 1.81/1.99 ;
% 1.81/1.99 ; Term-hash-array has 7,015 terms in all.
% 1.81/1.99 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.81/1.99 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.81/1.99 ; Path-index has 2,656 entries (2,665 at peak, 7,498 added, 4,842 deleted).
% 1.81/1.99 ; Path-index has 3,178 nodes (3,647 at peak, 5,478 added, 2,300 deleted).
% 1.81/1.99 ; Trie-index has 2,656 entries (2,665 at peak, 7,498 added, 4,842 deleted).
% 1.81/1.99 ; Trie-index has 13,305 nodes (13,536 at peak, 46,273 added, 32,968 deleted).
% 1.81/1.99 ; Retrieved 223,363 generalization terms in 100,587 calls.
% 1.81/1.99 ; Retrieved 37,091 instance terms in 3,204 calls.
% 1.81/1.99 ; Retrieved 36,717 unifiable terms in 979 calls.
% 1.81/1.99 ;
% 1.81/1.99 ; The agenda of rows to process has 294 entries:
% 1.81/1.99 ; 5 with value 29 24 with value 37 22 with value 45
% 1.81/1.99 ; 8 with value 30 10 with value 38 18 with value 46
% 1.81/1.99 ; 13 with value 31 10 with value 39 17 with value 47
% 1.81/1.99 ; 12 with value 32 13 with value 40 3 with value 48
% 1.81/1.99 ; 8 with value 33 13 with value 41 6 with value 49
% 1.81/1.99 ; 26 with value 34 11 with value 42 2 with value 50
% 1.81/1.99 ; 26 with value 35 16 with value 43 2 with value 51
% 1.81/1.99 ; 12 with value 36 15 with value 44 2 with value 52
% 1.81/1.99 ; The agenda of rows to give has 876 entries:
% 1.81/1.99 ; 3 with value (4 24) 75 with value (4 33) 11 with value (4 42)
% 1.81/1.99 ; 12 with value (4 25) 71 with value (4 34) 15 with value (4 43)
% 1.81/1.99 ; 23 with value (4 26) 72 with value (4 35) 13 with value (4 44)
% 1.81/1.99 ; 37 with value (4 27) 60 with value (4 36) 12 with value (4 45)
% 1.81/1.99 ; 42 with value (4 28) 48 with value (4 37) 13 with value (4 46)
% 1.81/1.99 ; 51 with value (4 29) 38 with value (4 38) 9 with value (4 47)
% 1.81/1.99 ; 43 with value (4 30) 27 with value (4 39) 4 with value (4 48)
% 1.81/1.99 ; 69 with value (4 31) 40 with value (4 40) 5 with value (4 49)
% 1.81/1.99 ; 61 with value (4 32) 21 with value (4 41) 1 with value (4 50)
% 1.81/1.99 Evaluation took:
% 1.81/1.99 1.497 seconds of real time
% 1.81/1.99 1.386209 seconds of user run time
% 1.81/1.99 0.110015 seconds of system run time
% 1.81/1.99 [Run times include 0.124 seconds GC run time.]
% 1.81/1.99 0 calls to %EVAL
% 1.81/1.99 0 page faults and
% 1.81/1.99 114,345,528 bytes consed.
% 1.81/1.99 :PROOF-FOUND
% 1.81/1.99 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T06:27:22
% 1.81/1.99 :PROOF-FOUND
% 1.81/1.99 *
%------------------------------------------------------------------------------