TSTP Solution File: GRP267-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP267-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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:43 EDT 2022
% Result : Unsatisfiable 11.27s 11.45s
% Output : Refutation 11.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 18
% Syntax : Number of clauses : 81 ( 22 unt; 53 nHn; 50 RR)
% Number of literals : 166 ( 165 equ; 38 neg)
% Maximal clause size : 10 ( 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 : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_5,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c2) = sk_c6
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c2) = sk_c6
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c7,sk_c4) = sk_c6
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c4
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_22,negated_conjecture,
( multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c6) != sk_c7
| inverse(Y) != sk_c6
| multiply(sk_c7,Z) != sk_c6
| multiply(U,sk_c7) != Z
| inverse(U) != sk_c7
| multiply(V,sk_c8) != sk_c7
| inverse(V) != sk_c8
| inverse(sk_c6) != sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(26,plain,
( multiply(X,sk_c6) != sk_c7
| inverse(X) != sk_c6
| multiply(sk_c7,Y) != sk_c6
| multiply(Z,sk_c7) != Y
| inverse(Z) != sk_c7
| multiply(U,sk_c8) != sk_c7
| inverse(U) != sk_c8
| inverse(sk_c6) != sk_c7 ),
inference('CONDENSE',[status(thm)],[prove_this_22]) ).
cnf(34,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(35,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(40,plain,
( inverse(sk_c6) = sk_c7
| multiply(sk_c4,X) = multiply(sk_c3,multiply(sk_c7,X)) ),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_18,theory(equality)]) ).
cnf(47,plain,
( inverse(sk_c6) = sk_c7
| multiply(multiply(X,sk_c7),sk_c4) = multiply(X,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_15,theory(equality)]) ).
cnf(79,plain,
( multiply(X,sk_c6) != sk_c7
| inverse(X) != sk_c6
| multiply(sk_c7,Y) != sk_c6
| multiply(Z,sk_c7) != Y
| inverse(Z) != sk_c7
| identity != sk_c7
| inverse(inverse(sk_c8)) != sk_c8
| inverse(sk_c6) != sk_c7 ),
inference('PARAMODULATE',[status(thm)],[26,left_inverse,theory(equality)]) ).
cnf(114,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[34,left_inverse,theory(equality)]) ).
cnf(115,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[34,34,theory(equality)]) ).
cnf(116,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[114,115,theory(equality)]) ).
cnf(117,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[35,116,theory(equality)]) ).
cnf(126,plain,
( inverse(sk_c3) = sk_c7
| sk_c8 = multiply(inverse(sk_c5),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_19,theory(equality)]) ).
cnf(127,plain,
( inverse(sk_c2) = sk_c6
| sk_c8 = multiply(inverse(sk_c5),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_10,theory(equality)]) ).
cnf(128,plain,
( inverse(sk_c1) = sk_c8
| sk_c8 = multiply(inverse(sk_c5),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[34,prove_this_4,theory(equality)]) ).
cnf(129,plain,
multiply(multiply(X,inverse(Y)),multiply(Y,Z)) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[associativity,34,theory(equality)]) ).
cnf(141,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,116,theory(equality)]) ).
cnf(146,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[117,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(147,plain,
( multiply(X,sk_c6) != sk_c7
| inverse(X) != sk_c6
| multiply(sk_c7,Y) != sk_c6
| multiply(Z,sk_c7) != Y
| inverse(Z) != sk_c7
| identity != sk_c7
| inverse(sk_c6) != sk_c7 ),
inference('REWRITE',[status(thm)],[79,146,theory(equality)]) ).
cnf(153,plain,
( inverse(sk_c1) = sk_c8
| multiply(multiply(X,sk_c7),sk_c6) = X ),
inference('PARAMODULATE',[status(thm)],[117,prove_this_6,theory(equality)]) ).
cnf(160,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,146,theory(equality)]) ).
cnf(161,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[117,146,theory(equality)]) ).
cnf(162,plain,
X = multiply(Y,multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[34,146,theory(equality)]) ).
cnf(165,plain,
( inverse(sk_c1) = sk_c8
| sk_c6 = inverse(sk_c7) ),
inference('PARAMODULATE',[status(thm)],[146,prove_this_6,theory(equality)]) ).
cnf(172,plain,
( inverse(sk_c3) = sk_c7
| multiply(sk_c6,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[160,prove_this_21,theory(equality)]) ).
cnf(173,plain,
( inverse(sk_c2) = sk_c6
| multiply(sk_c6,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[160,prove_this_12,theory(equality)]) ).
cnf(182,plain,
inverse(X) = multiply(inverse(multiply(Y,X)),Y),
inference('PARAMODULATE',[status(thm)],[34,161,theory(equality)]) ).
cnf(259,plain,
( inverse(sk_c3) = sk_c7
| sk_c8 = multiply(sk_c8,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[126,prove_this_20,theory(equality)]) ).
cnf(291,plain,
( inverse(sk_c2) = sk_c6
| sk_c8 = multiply(sk_c8,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[127,prove_this_11,theory(equality)]) ).
cnf(297,plain,
( inverse(sk_c2) = sk_c6
| identity = sk_c7 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,291,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(302,plain,
( identity = sk_c7
| multiply(sk_c2,sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[160,297,theory(equality)]) ).
cnf(319,plain,
( identity = sk_c7
| inverse(sk_c5) = sk_c8 ),
inference('PARAMODULATE',[status(thm)],[prove_this_8,302,theory(equality)]) ).
cnf(339,plain,
( identity = sk_c7
| multiply(sk_c5,sk_c8) = identity ),
inference('PARAMODULATE',[status(thm)],[160,319,theory(equality)]) ).
cnf(348,plain,
( inverse(sk_c1) = sk_c8
| sk_c8 = multiply(sk_c8,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[128,prove_this_5,theory(equality)]) ).
cnf(373,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[117,182,theory(equality)]) ).
cnf(459,plain,
( inverse(sk_c1) = sk_c8
| X = multiply(X,sk_c7) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[129,348,theory(equality)]),117,theory(equality)]) ).
cnf(460,plain,
( inverse(sk_c2) = sk_c6
| X = multiply(X,sk_c7) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[129,291,theory(equality)]),117,theory(equality)]) ).
cnf(461,plain,
( inverse(sk_c3) = sk_c7
| X = multiply(X,sk_c7) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[129,259,theory(equality)]),117,theory(equality)]) ).
cnf(481,plain,
( inverse(sk_c1) = sk_c8
| inverse(sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[left_inverse,459,theory(equality)]) ).
cnf(505,plain,
( inverse(sk_c2) = sk_c6
| identity = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[173,460,theory(equality)]) ).
cnf(516,plain,
( identity = sk_c6
| multiply(multiply(X,sk_c2),sk_c6) = X ),
inference('PARAMODULATE',[status(thm)],[161,505,theory(equality)]) ).
cnf(531,plain,
( inverse(sk_c3) = sk_c7
| identity = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[172,461,theory(equality)]) ).
cnf(542,plain,
( identity = sk_c6
| X = multiply(sk_c3,multiply(sk_c7,X)) ),
inference('PARAMODULATE',[status(thm)],[162,531,theory(equality)]) ).
cnf(559,plain,
( inverse(sk_c1) = sk_c8
| X = multiply(sk_c7,X) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[162,481,theory(equality)]),left_identity,theory(equality)]) ).
cnf(666,plain,
( inverse(sk_c1) = sk_c8
| multiply(X,sk_c6) = X ),
inference('PARAMODULATE',[status(thm)],[153,459,theory(equality)]) ).
cnf(684,plain,
( identity = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_1,339,theory(equality)]) ).
cnf(1198,plain,
inverse(sk_c1) = sk_c8,
inference('HYPERRESOLVE',[status(thm)],[26,559,666,165,459,prove_this_6,prove_this_4,prove_this_5,prove_this_6]) ).
cnf(1240,plain,
multiply(sk_c1,sk_c8) = identity,
inference('PARAMODULATE',[status(thm)],[160,1198,theory(equality)]) ).
cnf(1252,plain,
identity = sk_c7,
inference('REWRITE',[status(thm)],[684,1240,theory(equality)]) ).
cnf(1255,plain,
( multiply(sk_c2,sk_c6) = identity
| inverse(sk_c6) = identity ),
inference('REWRITE',[status(thm)],[prove_this_9,1252,theory(equality)]) ).
cnf(1272,plain,
( inverse(sk_c6) = identity
| multiply(sk_c4,X) = multiply(sk_c3,X) ),
inference('REWRITE',[status(thm)],[40,left_identity,1252,theory(equality)]) ).
cnf(1277,plain,
( inverse(sk_c6) = identity
| multiply(X,sk_c4) = multiply(X,sk_c6) ),
inference('REWRITE',[status(thm)],[47,116,1252,theory(equality)]) ).
cnf(1316,plain,
( multiply(X,sk_c6) != identity
| inverse(X) != sk_c6
| inverse(sk_c6) != identity ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[147,116,left_identity,1252,theory(equality)])]) ).
cnf(1355,plain,
( identity = sk_c6
| X = multiply(sk_c3,X) ),
inference('REWRITE',[status(thm)],[542,left_identity,1252,theory(equality)]) ).
cnf(1656,plain,
( inverse(sk_c6) = identity
| X = multiply(inverse(sk_c4),multiply(sk_c3,X)) ),
inference('PARAMODULATE',[status(thm)],[34,1272,theory(equality)]) ).
cnf(1672,plain,
( inverse(sk_c6) = identity
| multiply(sk_c2,sk_c4) = identity ),
inference('PARAMODULATE',[status(thm)],[1255,1277,theory(equality)]) ).
cnf(1677,plain,
( inverse(sk_c6) = identity
| sk_c4 = inverse(sk_c2) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,1672,theory(equality)]),left_identity,141,373,theory(equality)]) ).
cnf(1681,plain,
( sk_c4 = inverse(sk_c2)
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[146,1677,theory(equality)]),141,theory(equality)]) ).
cnf(1694,plain,
( identity = sk_c6
| multiply(multiply(X,sk_c4),sk_c2) = X ),
inference('PARAMODULATE',[status(thm)],[117,1681,theory(equality)]) ).
cnf(3183,plain,
( identity = sk_c6
| multiply(sk_c4,sk_c2) = sk_c3 ),
inference('PARAMODULATE',[status(thm)],[1694,1355,theory(equality)]) ).
cnf(8100,plain,
( identity = sk_c6
| sk_c4 = multiply(sk_c3,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[516,3183,theory(equality)]) ).
cnf(8122,plain,
( identity = sk_c6
| inverse(sk_c6) = identity ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1656,8100,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(8147,plain,
identity = sk_c6,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[146,8122,theory(equality)]),141,theory(equality)]) ).
cnf(8188,plain,
( X != identity
| inverse(X) != identity ),
inference('REWRITE',[status(thm)],[1316,141,116,8147,theory(equality)]) ).
cnf(9223,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[8188,141,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP267-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n018.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 : Tue Jun 14 05:15:58 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.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/sandbox/benchmark/theBenchmark.p 2022-06-14T05:15:58
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-14T05:15:58
% 0.20/0.51
% 0.20/0.51 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.20/0.51 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 11.27/11.45 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 11.27/11.45
% 11.27/11.45 #||
% 11.27/11.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.27/11.45 % SZS output start Refutation
% See solution above
% 11.27/11.46 ||#
% 11.27/11.46
% 11.27/11.46 ; Summary of computation:
% 11.27/11.46 ; 81931 formulas have been input or derived (from 638 formulas).
% 11.27/11.46 ; 9223 (11%) were retained. Of these,
% 11.27/11.46 ; 6399 (69%) were simplified or subsumed later,
% 11.27/11.46 ; 2824 (31%) are still being kept.
% 11.27/11.46 ;
% 11.27/11.46 ; Run time in seconds excluding printing time:
% 11.27/11.46 ; 0.005 0% Read assertion file (1 call)
% 11.27/11.46 ; 0.002 0% Assert (25 calls)
% 11.27/11.46 ; 0.849 8% Process new row (51,247 calls)
% 11.27/11.46 ; 2.097 19% Resolution (1,274 calls)
% 11.27/11.46 ; 0.473 4% Paramodulation (637 calls)
% 11.27/11.46 ; 0.001 0% Factoring (602 calls)
% 11.27/11.46 ; 0.207 2% Condensing (37,665 calls)
% 11.27/11.46 ; 2.921 27% Forward subsumption (37,665 calls)
% 11.27/11.46 ; 0.557 5% Backward subsumption (8,823 calls)
% 11.27/11.46 ; 0.753 7% Clause clause subsumption (228,322 calls)
% 11.27/11.46 ; 1.659 15% Forward simplification (47,065 calls)
% 11.27/11.46 ; 0.312 3% Backward simplification (9,222 calls)
% 11.27/11.46 ; 0.908 8% Ordering (294,237 calls)
% 11.27/11.46 ; 0.000 0% Sortal reasoning (32 calls)
% 11.27/11.46 ; 0.000 0% Purity testing (1 call)
% 11.27/11.46 ; 0.213 2% Other
% 11.27/11.46 ; 10.957 Total
% 11.27/11.46 ; 10.971 Real time
% 11.27/11.46 ;
% 11.27/11.46 ; Term-hash-array has 6,092 terms in all.
% 11.27/11.46 ; Feature-vector-row-index has 2,452 entries (6,388 at peak, 8,823 added, 6,371 deleted).
% 11.27/11.46 ; Feature-vector-row-index has 4,443 nodes (13,272 at peak, 23,126 added, 18,683 deleted).
% 11.27/11.46 ; Retrieved 460,028 possibly forward subsuming rows in 37,665 calls.
% 11.27/11.46 ; Retrieved 58,280 possibly backward subsumed rows in 8,823 calls.
% 11.27/11.46 ; Path-index has 2,966 entries (5,251 at peak, 6,342 added, 3,376 deleted).
% 11.27/11.46 ; Path-index has 1,439 nodes (1,621 at peak, 1,827 added, 388 deleted).
% 11.27/11.46 ; Trie-index has 2,966 entries (5,251 at peak, 6,342 added, 3,376 deleted).
% 11.27/11.46 ; Trie-index has 11,245 nodes (18,523 at peak, 21,106 added, 9,861 deleted).
% 11.27/11.46 ; Retrieved 123,858 generalization terms in 320,038 calls.
% 11.27/11.46 ; Retrieved 4,239 instance terms in 1,016 calls.
% 11.27/11.46 ; Retrieved 1,027,974 unifiable terms in 22,119 calls.
% 11.27/11.46 ;
% 11.27/11.46 ; The agenda of rows to process has 79 entries:
% 11.27/11.46 ; 2 with value 8 1 with value 14 10 with value 19
% 11.27/11.46 ; 2 with value 9 7 with value 15 6 with value 20
% 11.27/11.46 ; 2 with value 11 10 with value 16 6 with value 21
% 11.27/11.46 ; 3 with value 12 11 with value 17 4 with value 22
% 11.27/11.46 ; 3 with value 13 10 with value 18 2 with value 24
% 11.27/11.46 ; The agenda of rows to give has 2680 entries:
% 11.27/11.46 ; 8 with value (4 14) 102 with value (4 21) 302 with value (4 27)
% 11.27/11.46 ; 2 with value (4 15) 138 with value (4 22) 291 with value (4 28)
% 11.27/11.46 ; 9 with value (4 16) 126 with value (4 23) 446 with value (4 29)
% 11.27/11.46 ; 7 with value (4 17) 199 with value (4 24) 252 with value (4 30)
% 11.27/11.46 ; 19 with value (4 18) 272 with value (4 25) 133 with value (4 31)
% 11.27/11.46 ; 29 with value (4 19) 239 with value (4 26) 2 with value (4 32)
% 11.27/11.46 ; 104 with value (4 20)
% 11.27/11.46 Evaluation took:
% 11.27/11.46 10.972 seconds of real time
% 11.27/11.46 10.067777 seconds of user run time
% 11.27/11.46 0.903688 seconds of system run time
% 11.27/11.46 [Run times include 0.692 seconds GC run time.]
% 11.27/11.46 0 calls to %EVAL
% 11.27/11.46 0 page faults and
% 11.27/11.46 946,490,744 bytes consed.
% 11.27/11.46 :PROOF-FOUND
% 11.27/11.46 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T05:16:09
% 11.27/11.46 :PROOF-FOUND
% 11.27/11.46 *
%------------------------------------------------------------------------------