TSTP Solution File: GRP334-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP334-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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:54 EDT 2022
% Result : Unsatisfiable 18.14s 18.35s
% Output : Refutation 18.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of clauses : 86 ( 44 unt; 34 nHn; 50 RR)
% Number of literals : 153 ( 152 equ; 41 neg)
% Maximal clause size : 10 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 73 ( 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,
multiply(sk_c6,sk_c7) = sk_c5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c6,sk_c4) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c3,sk_c6) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| inverse(sk_c3) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c6,sk_c4) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c1) = sk_c6
| multiply(sk_c3,sk_c6) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c6
| inverse(sk_c3) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c6) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_13,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c7) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| inverse(sk_c6) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| inverse(sk_c7) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c6,sk_c7) != sk_c5
| multiply(X,sk_c6) != sk_c7
| inverse(X) != sk_c6
| inverse(Y) != sk_c6
| multiply(Y,sk_c5) != sk_c6
| inverse(sk_c6) != sk_c5
| inverse(sk_c7) != sk_c5
| multiply(sk_c6,Z) != sk_c5
| multiply(U,sk_c6) != Z
| inverse(U) != sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(26,plain,
( multiply(X,sk_c6) != sk_c7
| inverse(X) != sk_c6
| inverse(Y) != sk_c6
| multiply(Y,sk_c5) != sk_c6
| inverse(sk_c6) != sk_c5
| inverse(sk_c7) != sk_c5
| multiply(sk_c6,Z) != sk_c5
| multiply(U,sk_c6) != Z
| inverse(U) != sk_c6 ),
inference('REWRITE',[status(thm)],[prove_this_22,prove_this_1,theory(equality)]) ).
cnf(33,plain,
multiply(sk_c5,X) = multiply(sk_c6,multiply(sk_c7,X)),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_1,theory(equality)]) ).
cnf(34,plain,
multiply(multiply(X,sk_c6),sk_c7) = multiply(X,sk_c5),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_1,theory(equality)]) ).
cnf(36,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(37,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(73,plain,
( inverse(X) != sk_c6
| multiply(X,sk_c5) != sk_c6
| inverse(sk_c6) != sk_c5
| inverse(sk_c7) != sk_c5
| multiply(Y,sk_c6) != sk_c7
| inverse(Y) != sk_c6 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[26,prove_this_1,theory(equality)]),theory(equality)])]) ).
cnf(74,plain,
sk_c7 = multiply(inverse(sk_c6),sk_c5),
inference('PARAMODULATE',[status(thm)],[36,prove_this_1,theory(equality)]) ).
cnf(76,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[36,left_inverse,theory(equality)]) ).
cnf(77,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[36,36,theory(equality)]) ).
cnf(78,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[76,77,theory(equality)]) ).
cnf(79,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[37,78,theory(equality)]) ).
cnf(85,plain,
( inverse(sk_c3) = sk_c6
| sk_c6 = multiply(inverse(sk_c1),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[36,prove_this_6,theory(equality)]) ).
cnf(89,plain,
( inverse(sk_c1) = sk_c6
| sk_c6 = multiply(inverse(sk_c3),sk_c4) ),
inference('PARAMODULATE',[status(thm)],[36,prove_this_10,theory(equality)]) ).
cnf(90,plain,
multiply(multiply(X,inverse(Y)),multiply(Y,Z)) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[associativity,36,theory(equality)]) ).
cnf(101,plain,
X = multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X))),
inference('PARAMODULATE',[status(thm)],[36,associativity,theory(equality)]) ).
cnf(102,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,78,theory(equality)]) ).
cnf(105,plain,
multiply(sk_c7,X) = multiply(inverse(sk_c6),multiply(sk_c5,X)),
inference('PARAMODULATE',[status(thm)],[associativity,74,theory(equality)]) ).
cnf(108,plain,
multiply(multiply(X,inverse(sk_c6)),sk_c5) = multiply(X,sk_c7),
inference('PARAMODULATE',[status(thm)],[associativity,74,theory(equality)]) ).
cnf(113,plain,
multiply(multiply(X,sk_c6),multiply(sk_c7,Y)) = multiply(X,multiply(sk_c5,Y)),
inference('PARAMODULATE',[status(thm)],[associativity,33,theory(equality)]) ).
cnf(114,plain,
sk_c7 = multiply(inverse(multiply(X,sk_c6)),multiply(X,sk_c5)),
inference('PARAMODULATE',[status(thm)],[36,34,theory(equality)]) ).
cnf(122,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[79,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(132,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,122,theory(equality)]) ).
cnf(135,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[79,122,theory(equality)]) ).
cnf(136,plain,
X = multiply(Y,multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[36,122,theory(equality)]) ).
cnf(139,plain,
( inverse(sk_c2) = sk_c6
| sk_c7 = inverse(sk_c5) ),
inference('PARAMODULATE',[status(thm)],[122,prove_this_13,theory(equality)]) ).
cnf(141,plain,
( inverse(sk_c2) = sk_c6
| sk_c6 = inverse(sk_c5) ),
inference('PARAMODULATE',[status(thm)],[122,prove_this_12,theory(equality)]) ).
cnf(143,plain,
multiply(sk_c5,inverse(sk_c7)) = sk_c6,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,132,theory(equality)]),78,theory(equality)]) ).
cnf(171,plain,
inverse(sk_c7) = multiply(inverse(sk_c5),sk_c6),
inference('PARAMODULATE',[status(thm)],[36,143,theory(equality)]) ).
cnf(172,plain,
multiply(multiply(X,sk_c5),inverse(sk_c7)) = multiply(X,sk_c6),
inference('PARAMODULATE',[status(thm)],[associativity,143,theory(equality)]) ).
cnf(195,plain,
multiply(X,Y) = multiply(multiply(X,Z),multiply(inverse(Z),Y)),
inference('PARAMODULATE',[status(thm)],[associativity,135,theory(equality)]) ).
cnf(237,plain,
( inverse(sk_c2) = sk_c6
| sk_c6 = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[139,141,theory(equality)]) ).
cnf(239,plain,
( sk_c6 = sk_c7
| sk_c2 = inverse(sk_c6) ),
inference('PARAMODULATE',[status(thm)],[122,237,theory(equality)]) ).
cnf(298,plain,
( sk_c6 = sk_c7
| sk_c7 = multiply(sk_c2,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[74,239,theory(equality)]) ).
cnf(368,plain,
sk_c7 = multiply(inverse(multiply(X,multiply(Y,sk_c6))),multiply(multiply(X,Y),sk_c5)),
inference('PARAMODULATE',[status(thm)],[114,associativity,theory(equality)]) ).
cnf(522,plain,
( inverse(sk_c1) = sk_c6
| sk_c6 = multiply(sk_c6,sk_c4) ),
inference('PARAMODULATE',[status(thm)],[89,prove_this_11,theory(equality)]) ).
cnf(526,plain,
( inverse(sk_c1) = sk_c6
| sk_c5 = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_9,522,theory(equality)]) ).
cnf(538,plain,
( sk_c5 = sk_c6
| X = multiply(sk_c6,multiply(sk_c1,X)) ),
inference('PARAMODULATE',[status(thm)],[36,526,theory(equality)]) ).
cnf(541,plain,
( sk_c5 = sk_c6
| inverse(sk_c3) = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[85,526,theory(equality)]),prove_this_1,theory(equality)]) ).
cnf(714,plain,
( sk_c5 = sk_c6
| sk_c3 = inverse(sk_c6) ),
inference('PARAMODULATE',[status(thm)],[122,541,theory(equality)]) ).
cnf(796,plain,
( sk_c5 = sk_c6
| sk_c7 = multiply(sk_c3,sk_c5) ),
inference('PARAMODULATE',[status(thm)],[74,714,theory(equality)]) ).
cnf(1287,plain,
( sk_c6 = sk_c7
| inverse(sk_c7) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_18,298,theory(equality)]) ).
cnf(1288,plain,
( sk_c6 = sk_c7
| inverse(sk_c6) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_17,298,theory(equality)]) ).
cnf(1362,plain,
( sk_c6 = sk_c7
| sk_c7 = inverse(sk_c5) ),
inference('PARAMODULATE',[status(thm)],[122,1287,theory(equality)]) ).
cnf(1379,plain,
( sk_c6 = sk_c7
| sk_c6 = inverse(sk_c5) ),
inference('PARAMODULATE',[status(thm)],[122,1288,theory(equality)]) ).
cnf(1555,plain,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(X,sk_c7) = multiply(X,sk_c4) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[90,prove_this_4,theory(equality)]),108,theory(equality)]) ).
cnf(1774,plain,
multiply(inverse(X),Y) = multiply(inverse(multiply(Z,X)),multiply(Z,Y)),
inference('PARAMODULATE',[status(thm)],[101,136,theory(equality)]) ).
cnf(2948,plain,
sk_c6 = sk_c7,
inference('PARAMODULATE',[status(thm)],[1362,1379,theory(equality)]) ).
cnf(2949,plain,
multiply(sk_c6,sk_c6) = sk_c5,
inference('REWRITE',[status(thm)],[prove_this_1,2948,theory(equality)]) ).
cnf(2969,plain,
( multiply(sk_c1,sk_c6) = sk_c6
| multiply(sk_c3,sk_c6) = sk_c4 ),
inference('REWRITE',[status(thm)],[prove_this_5,2948,theory(equality)]) ).
cnf(2981,plain,
( inverse(X) != sk_c6
| multiply(X,sk_c5) != sk_c6
| inverse(sk_c6) != sk_c5
| multiply(Y,sk_c6) != sk_c6
| inverse(Y) != sk_c6 ),
inference('REWRITE',[status(thm)],[73,2948,theory(equality)]) ).
cnf(2989,plain,
multiply(sk_c6,X) = multiply(inverse(sk_c6),multiply(sk_c5,X)),
inference('REWRITE',[status(thm)],[105,2948,theory(equality)]) ).
cnf(2991,plain,
multiply(multiply(X,sk_c6),multiply(sk_c6,Y)) = multiply(X,multiply(sk_c5,Y)),
inference('REWRITE',[status(thm)],[113,2948,theory(equality)]) ).
cnf(3006,plain,
inverse(sk_c6) = multiply(inverse(sk_c5),sk_c6),
inference('REWRITE',[status(thm)],[171,2948,theory(equality)]) ).
cnf(3007,plain,
multiply(multiply(X,sk_c5),inverse(sk_c6)) = multiply(X,sk_c6),
inference('REWRITE',[status(thm)],[172,2948,theory(equality)]) ).
cnf(3054,plain,
sk_c6 = multiply(inverse(multiply(X,multiply(Y,sk_c6))),multiply(multiply(X,Y),sk_c5)),
inference('REWRITE',[status(thm)],[368,2948,theory(equality)]) ).
cnf(3103,plain,
( sk_c5 = sk_c6
| sk_c6 = multiply(sk_c3,sk_c5) ),
inference('REWRITE',[status(thm)],[796,2948,theory(equality)]) ).
cnf(3262,plain,
( multiply(sk_c1,sk_c6) = sk_c6
| multiply(X,sk_c6) = multiply(X,sk_c4) ),
inference('REWRITE',[status(thm)],[1555,2948,theory(equality)]) ).
cnf(8379,plain,
( multiply(sk_c1,sk_c6) = sk_c6
| multiply(sk_c3,sk_c4) = sk_c4 ),
inference('PARAMODULATE',[status(thm)],[2969,3262,theory(equality)]) ).
cnf(8478,plain,
( multiply(sk_c3,sk_c4) = sk_c4
| sk_c5 = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[538,8379,theory(equality)]),2949,theory(equality)]) ).
cnf(18567,plain,
( sk_c5 = sk_c6
| X = multiply(sk_c3,X) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[195,8478,theory(equality)]),136,theory(equality)]) ).
cnf(18935,plain,
sk_c5 = sk_c6,
inference('PARAMODULATE',[status(thm)],[3103,18567,theory(equality)]) ).
cnf(19262,plain,
( inverse(sk_c5) != sk_c5
| multiply(X,sk_c5) != sk_c5
| inverse(X) != sk_c5 ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[2981,18935,theory(equality)])]) ).
cnf(19265,plain,
X = multiply(sk_c5,X),
inference('REWRITE',[status(thm)],[2989,36,18935,theory(equality)]) ).
cnf(19515,plain,
multiply(multiply(X,sk_c5),Y) = multiply(X,Y),
inference('REWRITE',[status(thm)],[2991,19265,18935,theory(equality)]) ).
cnf(19558,plain,
inverse(sk_c5) = identity,
inference('REWRITE',[status(thm)],[3006,left_inverse,18935,theory(equality)]) ).
cnf(19563,plain,
( identity != sk_c5
| multiply(X,sk_c5) != sk_c5
| inverse(X) != sk_c5 ),
inference('REWRITE',[status(thm)],[19262,19558,theory(equality)]) ).
cnf(19566,plain,
multiply(X,sk_c5) = X,
inference('REWRITE',[status(thm)],[3007,78,19515,19558,18935,theory(equality)]) ).
cnf(19640,plain,
( identity != sk_c5
| X != sk_c5
| inverse(X) != sk_c5 ),
inference('REWRITE',[status(thm)],[19563,19566,theory(equality)]) ).
cnf(19689,plain,
identity = sk_c5,
inference('REWRITE',[status(thm)],[3054,left_inverse,1774,19566,18935,theory(equality)]) ).
cnf(19844,plain,
( X != identity
| inverse(X) != identity ),
inference('REWRITE',[status(thm)],[19640,19689,theory(equality)]) ).
cnf(20824,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[19844,102,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP334-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 18:06:33 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:06:33
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-13T18:06:33
% 0.19/0.48
% 0.19/0.48 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.48 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 18.14/18.35 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 18.14/18.35
% 18.14/18.35 #||
% 18.14/18.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.14/18.35 % SZS output start Refutation
% See solution above
% 18.14/18.35 ||#
% 18.14/18.35
% 18.14/18.35 ; Summary of computation:
% 18.14/18.35 ; 83012 formulas have been input or derived (from 980 formulas).
% 18.14/18.35 ; 20824 (25%) were retained. Of these,
% 18.14/18.35 ; 18839 (90%) were simplified or subsumed later,
% 18.14/18.35 ; 1985 (10%) are still being kept.
% 18.14/18.35 ;
% 18.14/18.35 ; Run time in seconds excluding printing time:
% 18.14/18.35 ; 0.005 0% Read assertion file (1 call)
% 18.14/18.35 ; 0.002 0% Assert (25 calls)
% 18.14/18.35 ; 1.562 9% Process new row (82,516 calls)
% 18.14/18.35 ; 0.074 0% Resolution (1,958 calls)
% 18.14/18.35 ; 0.804 4% Paramodulation (979 calls)
% 18.14/18.35 ; 0.000 0% Factoring (914 calls)
% 18.14/18.35 ; 0.276 2% Condensing (68,977 calls)
% 18.14/18.35 ; 6.672 37% Forward subsumption (68,977 calls)
% 18.14/18.35 ; 2.231 12% Backward subsumption (20,098 calls)
% 18.14/18.35 ; 1.541 9% Clause clause subsumption (540,824 calls)
% 18.14/18.35 ; 2.312 13% Forward simplification (81,541 calls)
% 18.14/18.35 ; 0.864 5% Backward simplification (20,823 calls)
% 18.14/18.35 ; 1.247 7% Ordering (498,938 calls)
% 18.14/18.35 ; 0.000 0% Sortal reasoning (32 calls)
% 18.14/18.35 ; 0.000 0% Purity testing (1 call)
% 18.14/18.35 ; 0.291 2% Other
% 18.14/18.35 ; 17.881 Total
% 18.14/18.35 ; 17.887 Real time
% 18.14/18.35 ;
% 18.14/18.35 ; Term-hash-array has 8,714 terms in all.
% 18.14/18.35 ; Feature-vector-row-index has 1,630 entries (13,988 at peak, 20,098 added, 18,468 deleted).
% 18.14/18.35 ; Feature-vector-row-index has 3,771 nodes (43,166 at peak, 65,807 added, 62,036 deleted).
% 18.14/18.35 ; Retrieved 946,326 possibly forward subsuming rows in 68,977 calls.
% 18.14/18.35 ; Retrieved 151,260 possibly backward subsumed rows in 20,098 calls.
% 18.14/18.35 ; Path-index has 1,962 entries (7,599 at peak, 9,718 added, 7,756 deleted).
% 18.14/18.35 ; Path-index has 1,071 nodes (1,521 at peak, 1,878 added, 807 deleted).
% 18.14/18.35 ; Trie-index has 1,962 entries (7,599 at peak, 9,718 added, 7,756 deleted).
% 18.14/18.35 ; Trie-index has 7,143 nodes (24,976 at peak, 30,444 added, 23,301 deleted).
% 18.14/18.35 ; Retrieved 189,447 generalization terms in 454,208 calls.
% 18.14/18.35 ; Retrieved 5,699 instance terms in 1,732 calls.
% 18.14/18.35 ; Retrieved 54,356 unifiable terms in 5,672 calls.
% 18.14/18.35 ;
% 18.14/18.35 ; The agenda of rows to process has 41 entries:
% 18.14/18.35 ; 2 with value 8 1 with value 14 2 with value 19
% 18.14/18.35 ; 1 with value 9 2 with value 15 5 with value 20
% 18.14/18.35 ; 1 with value 10 3 with value 16 3 with value 21
% 18.14/18.35 ; 1 with value 11 4 with value 17 2 with value 22
% 18.14/18.35 ; 3 with value 12 5 with value 18 2 with value 24
% 18.14/18.35 ; 4 with value 13
% 18.14/18.35 ; The agenda of rows to give has 1932 entries:
% 18.14/18.35 ; 1 with value (4 12) 25 with value (4 19) 207 with value (4 26)
% 18.14/18.35 ; 1 with value (4 13) 69 with value (4 20) 224 with value (4 27)
% 18.14/18.35 ; 2 with value (4 14) 83 with value (4 21) 108 with value (4 28)
% 18.14/18.35 ; 7 with value (4 15) 119 with value (4 22) 133 with value (4 29)
% 18.14/18.35 ; 9 with value (4 16) 131 with value (4 23) 256 with value (4 30)
% 18.14/18.35 ; 22 with value (4 17) 133 with value (4 24) 130 with value (4 31)
% 18.14/18.35 ; 27 with value (4 18) 239 with value (4 25) 6 with value (4 32)
% 18.14/18.35 Evaluation took:
% 18.14/18.35 17.888 seconds of real time
% 18.14/18.35 16.016031 seconds of user run time
% 18.14/18.35 1.871009 seconds of system run time
% 18.14/18.35 [Run times include 1.906 seconds GC run time.]
% 18.14/18.35 0 calls to %EVAL
% 18.14/18.35 0 page faults and
% 18.14/18.35 1,582,419,120 bytes consed.
% 18.14/18.35 :PROOF-FOUND
% 18.14/18.35 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:06:51
% 18.14/18.35 :PROOF-FOUND
% 18.14/18.35 *
%------------------------------------------------------------------------------