TSTP Solution File: SYN015-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYN015-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 21 11:56:33 EDT 2022
% Result : Unsatisfiable 0.86s 1.05s
% Output : Refutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 57
% Number of leaves : 16
% Syntax : Number of clauses : 92 ( 6 unt; 83 nHn; 89 RR)
% Number of literals : 350 ( 272 equ; 37 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_1,negated_conjecture,
m != n,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_1) ).
cnf(c_2,negated_conjecture,
( X = j
| X != k
| element(X,j) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_2) ).
cnf(c_3,negated_conjecture,
( X = j
| X = k
| ~ element(X,j) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_3) ).
cnf(c_4,negated_conjecture,
( X = m
| ~ element(X,m)
| f(X) != m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_4) ).
cnf(c_5,negated_conjecture,
( X = m
| ~ element(X,m)
| f(X) != X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_5) ).
cnf(c_6,negated_conjecture,
( X = m
| ~ element(X,m)
| element(X,f(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_6) ).
cnf(c_7,negated_conjecture,
( X = m
| ~ element(X,m)
| element(f(X),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_7) ).
cnf(c_8,negated_conjecture,
( X = m
| element(X,m)
| Y = m
| Y = X
| ~ element(X,Y)
| ~ element(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_8) ).
cnf(c_9,negated_conjecture,
( X = n
| element(X,n)
| g(X) != n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_9) ).
cnf(c_10,negated_conjecture,
( X = n
| element(X,n)
| g(X) != X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_10) ).
cnf(c_11,negated_conjecture,
( X = n
| element(X,n)
| element(X,g(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_11) ).
cnf(c_12,negated_conjecture,
( X = n
| element(X,n)
| element(g(X),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_12) ).
cnf(c_13,negated_conjecture,
( X = n
| ~ element(X,n)
| Y = n
| Y = X
| ~ element(X,Y)
| ~ element(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_13) ).
cnf(c_14,negated_conjecture,
( X = k
| X != m
| element(X,k) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_14) ).
cnf(c_15,negated_conjecture,
( X = k
| X != n
| element(X,k) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_15) ).
cnf(c_16,negated_conjecture,
( X = k
| X = m
| X = n
| ~ element(X,k) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_16) ).
cnf(17,plain,
( k = j
| element(k,j) ),
inference('HYPERRESOLVE',[status(thm)],[c_2,theory(equality)]) ).
cnf(18,plain,
( m = k
| element(m,k) ),
inference('HYPERRESOLVE',[status(thm)],[c_14,theory(equality)]) ).
cnf(19,plain,
( n = k
| element(n,k) ),
inference('HYPERRESOLVE',[status(thm)],[c_15,theory(equality)]) ).
cnf(20,plain,
( j = n
| element(j,n)
| g(j) = j
| g(j) = k ),
inference('HYPERRESOLVE',[status(thm)],[c_3,c_12]) ).
cnf(23,plain,
( n = k
| element(k,n)
| g(k) = k
| g(k) = m
| g(k) = n ),
inference('HYPERRESOLVE',[status(thm)],[c_16,c_12]) ).
cnf(24,plain,
( X = n
| element(X,n)
| X = m
| element(X,m)
| g(X) = m
| g(X) = X ),
inference('HYPERRESOLVE',[status(thm)],[c_8,c_11,c_12]) ).
cnf(30,plain,
( n = k
| m = k
| element(k,m)
| g(k) = m
| g(k) = k ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,24,19]),c_1]) ).
cnf(35,plain,
( n = k
| m = k
| g(k) = m
| g(k) = k
| g(k) = n ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,30,23,18]),c_1]) ).
cnf(38,plain,
( n = k
| m = k
| g(k) = m
| g(k) = k
| element(k,n) ),
inference('HYPERRESOLVE',[status(thm)],[c_9,35]) ).
cnf(40,plain,
( n = k
| m = k
| g(k) = m
| g(k) = k ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,38,30,18]),c_1]) ).
cnf(42,plain,
( n = k
| m = k
| g(k) = k
| element(k,n)
| element(k,m) ),
inference('PARAMODULATE',[status(thm)],[c_11,40,theory(equality)]) ).
cnf(43,plain,
( n = k
| m = k
| g(k) = k
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,42,19]),c_1]) ).
cnf(44,plain,
( n = k
| m = k
| g(k) = k
| element(f(k),k) ),
inference('HYPERRESOLVE',[status(thm)],[c_7,43]) ).
cnf(45,plain,
( n = k
| m = k
| g(k) = k
| element(k,f(k)) ),
inference('HYPERRESOLVE',[status(thm)],[c_6,43]) ).
cnf(46,plain,
( n = k
| m = k
| g(k) = k
| f(k) = k
| f(k) = m
| f(k) = n ),
inference('HYPERRESOLVE',[status(thm)],[c_16,44]) ).
cnf(53,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m
| f(k) = n
| element(k,n) ),
inference('HYPERRESOLVE',[status(thm)],[c_10,46]) ).
cnf(55,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m
| f(k) = n
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,53,19]),c_1]) ).
cnf(59,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m
| f(k) = n ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,55,53,18]),c_1]) ).
cnf(61,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m
| g(k) = k
| element(k,n) ),
inference('PARAMODULATE',[status(thm)],[45,59,theory(equality)]) ).
cnf(64,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m
| g(k) = k ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,61,43,18]),c_1]) ).
cnf(65,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m
| element(k,n) ),
inference('HYPERRESOLVE',[status(thm)],[c_10,64]) ).
cnf(67,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,65,19]),c_1]) ).
cnf(69,plain,
( n = k
| m = k
| f(k) = k
| f(k) = m ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_13,67,65,18]),c_1]) ).
cnf(70,plain,
( n = k
| m = k
| f(k) = k
| g(k) = k ),
inference('HYPERRESOLVE',[status(thm)],[c_4,69,43]) ).
cnf(72,plain,
( n = k
| m = k
| f(k) = k
| ~ element(k,m) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c_4,69,theory(equality)]),theory(equality)]) ).
cnf(73,plain,
( n = k
| m = k
| f(k) = k
| element(k,n) ),
inference('HYPERRESOLVE',[status(thm)],[c_10,70]) ).
cnf(75,plain,
( n = k
| m = k
| f(k) = k
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,73,19]),c_1]) ).
cnf(77,plain,
( n = k
| m = k
| f(k) = k ),
inference('HYPERRESOLVE',[status(thm)],[72,75]) ).
cnf(78,plain,
( n = k
| m = k
| g(k) = k ),
inference('HYPERRESOLVE',[status(thm)],[c_5,77,43]) ).
cnf(79,plain,
( n = k
| m = k
| ~ element(k,m) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c_5,77,theory(equality)]),theory(equality)]) ).
cnf(81,plain,
( n = k
| m = k
| element(k,n) ),
inference('HYPERRESOLVE',[status(thm)],[c_10,78]) ).
cnf(83,plain,
( n = k
| m = k
| element(k,m) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,81,19]),c_1]) ).
cnf(85,plain,
( n = k
| m = k ),
inference('HYPERRESOLVE',[status(thm)],[79,83]) ).
cnf(87,plain,
( m = k
| X = k
| element(X,k)
| g(X) != k ),
inference('PARAMODULATE',[status(thm)],[c_9,85,theory(equality)]) ).
cnf(88,plain,
( m = k
| k = j
| element(j,k)
| g(j) = j
| g(j) = k ),
inference('PARAMODULATE',[status(thm)],[20,85,theory(equality)]) ).
cnf(94,plain,
( m = k
| k = j
| g(j) = j
| g(j) = k
| j = m
| j = n ),
inference('HYPERRESOLVE',[status(thm)],[c_16,88]) ).
cnf(109,plain,
( m = k
| k = j
| g(j) = j
| j = m
| j = n
| element(j,k) ),
inference('HYPERRESOLVE',[status(thm)],[87,94]) ).
cnf(116,plain,
( m = k
| k = j
| g(j) = j
| j = m
| j = n ),
inference('HYPERRESOLVE',[status(thm)],[c_16,109]) ).
cnf(117,plain,
( m = k
| k = j
| j = m
| j = n
| element(j,n) ),
inference('HYPERRESOLVE',[status(thm)],[c_10,116]) ).
cnf(118,plain,
( m = k
| k = j
| j = m
| element(j,k) ),
inference('PARAMODULATE',[status(thm)],[117,85,theory(equality)]) ).
cnf(121,plain,
( m = k
| k = j
| j = m
| j = n ),
inference('HYPERRESOLVE',[status(thm)],[c_16,118]) ).
cnf(124,plain,
( m = k
| k = j
| j = m ),
inference('PARAMODULATE',[status(thm)],[85,121,theory(equality)]) ).
cnf(126,plain,
( k = j
| j = m
| n != k ),
inference('PARAMODULATE',[status(thm)],[c_1,124,theory(equality)]) ).
cnf(127,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| element(f(X),X) ),
inference('PARAMODULATE',[status(thm)],[c_7,124,theory(equality)]) ).
cnf(128,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| element(X,f(X)) ),
inference('PARAMODULATE',[status(thm)],[c_6,124,theory(equality)]) ).
cnf(129,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| f(X) != X ),
inference('PARAMODULATE',[status(thm)],[c_5,124,theory(equality)]) ).
cnf(130,plain,
( k = j
| j = m
| X = k
| ~ element(X,k)
| f(X) != k ),
inference('PARAMODULATE',[status(thm)],[c_4,124,theory(equality)]) ).
cnf(142,plain,
( n = k
| k = j
| j = m
| element(f(n),n) ),
inference('HYPERRESOLVE',[status(thm)],[127,19]) ).
cnf(143,plain,
( n = k
| k = j
| j = m
| element(n,f(n)) ),
inference('HYPERRESOLVE',[status(thm)],[128,19]) ).
cnf(145,plain,
( n = k
| k = j
| j = m
| f(n) = m
| element(f(n),m)
| f(n) = n ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_8,143,142]),c_1]) ).
cnf(177,plain,
( k = j
| j = m
| n = k
| f(n) = k
| element(f(n),k)
| f(n) = n ),
inference('PARAMODULATE',[status(thm)],[145,124,theory(equality)]) ).
cnf(196,plain,
( k = j
| j = m
| n = k
| f(n) = k
| f(n) = n
| f(n) = m ),
inference('HYPERRESOLVE',[status(thm)],[c_16,177]) ).
cnf(210,plain,
( k = j
| j = m
| n = k
| f(n) = k
| f(n) = m ),
inference('HYPERRESOLVE',[status(thm)],[129,196,19]) ).
cnf(211,plain,
( k = j
| j = m
| n = k
| f(n) = k
| element(n,m) ),
inference('PARAMODULATE',[status(thm)],[143,210,theory(equality)]) ).
cnf(216,plain,
( k = j
| j = m
| n = k
| f(n) = k ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[c_4,211,210]),c_1]) ).
cnf(217,plain,
( k = j
| j = m
| n = k ),
inference('HYPERRESOLVE',[status(thm)],[130,216,19]) ).
cnf(218,plain,
( k = j
| j = m ),
inference('HYPERRESOLVE',[status(thm)],[126,217]) ).
cnf(222,plain,
( k = j
| X = j
| ~ element(X,j)
| element(f(X),X) ),
inference('PARAMODULATE',[status(thm)],[c_7,218,theory(equality)]) ).
cnf(223,plain,
( k = j
| X = j
| ~ element(X,j)
| element(X,f(X)) ),
inference('PARAMODULATE',[status(thm)],[c_6,218,theory(equality)]) ).
cnf(224,plain,
( k = j
| X = j
| ~ element(X,j)
| f(X) != X ),
inference('PARAMODULATE',[status(thm)],[c_5,218,theory(equality)]) ).
cnf(241,plain,
( k = j
| element(f(k),k) ),
inference('HYPERRESOLVE',[status(thm)],[222,17]) ).
cnf(243,plain,
( k = j
| f(k) = k
| f(k) = m
| f(k) = n ),
inference('HYPERRESOLVE',[status(thm)],[c_16,241]) ).
cnf(245,plain,
( k = j
| element(k,f(k)) ),
inference('HYPERRESOLVE',[status(thm)],[223,17]) ).
cnf(268,plain,
( k = j
| f(k) = k
| f(k) = m
| ~ element(k,j)
| n != k ),
inference('PARAMODULATE',[status(thm)],[224,243,theory(equality)]) ).
cnf(285,plain,
( k = j
| m = k
| f(k) = k
| f(k) = m ),
inference('HYPERRESOLVE',[status(thm)],[268,17,85]) ).
cnf(286,plain,
( k = j
| m = k
| f(k) = k
| element(k,m) ),
inference('PARAMODULATE',[status(thm)],[245,285,theory(equality)]) ).
cnf(289,plain,
( k = j
| m = k
| f(k) = k ),
inference('HYPERRESOLVE',[status(thm)],[c_4,286,285]) ).
cnf(290,plain,
( k = j
| m = k ),
inference('HYPERRESOLVE',[status(thm)],[224,289,17]) ).
cnf(291,plain,
k = j,
inference('PARAMODULATE',[status(thm)],[218,290,theory(equality)]) ).
cnf(292,plain,
( X = j
| ~ element(X,j) ),
inference('REWRITE',[status(thm)],[c_3,291,theory(equality)]) ).
cnf(295,plain,
( j = m
| element(m,j) ),
inference('REWRITE',[status(thm)],[18,291,theory(equality)]) ).
cnf(296,plain,
( j = n
| element(n,j) ),
inference('REWRITE',[status(thm)],[19,291,theory(equality)]) ).
cnf(305,plain,
j = m,
inference('HYPERRESOLVE',[status(thm)],[292,295]) ).
cnf(306,plain,
j != n,
inference('REWRITE',[status(thm)],[c_1,305,theory(equality)]) ).
cnf(307,plain,
element(n,j),
inference('REWRITE',[status(thm)],[296,306]) ).
cnf(322,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[292,306]),307]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 23:48:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T23:48:39
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-07-11T23:48:39
% 0.86/1.05
% 0.86/1.05
% 0.86/1.05 #||
% 0.86/1.05 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.86/1.05 % SZS output start Refutation
% See solution above
% 0.86/1.06 ||#
% 0.86/1.06
% 0.86/1.06 ; Summary of computation:
% 0.86/1.06 ; 2238 formulas have been input or derived (from 183 formulas).
% 0.86/1.06 ; 322 (14%) were retained. Of these,
% 0.86/1.06 ; 296 (92%) were simplified or subsumed later,
% 0.86/1.06 ; 26 ( 8%) are still being kept.
% 0.86/1.06 ;
% 0.86/1.06 ; Run time in seconds excluding printing time:
% 0.86/1.06 ; 0.004 1% Read assertion file (1 call)
% 0.86/1.06 ; 0.000 0% Assert (16 calls)
% 0.86/1.06 ; 0.037 6% Process new row (1,962 calls)
% 0.86/1.06 ; 0.107 18% Resolution (364 calls)
% 0.86/1.06 ; 0.043 7% Paramodulation (182 calls)
% 0.86/1.06 ; 0.003 1% Factoring (145 calls)
% 0.86/1.06 ; 0.015 3% Condensing (1,127 calls)
% 0.86/1.06 ; 0.174 30% Forward subsumption (1,127 calls)
% 0.86/1.06 ; 0.017 3% Backward subsumption (316 calls)
% 0.86/1.06 ; 0.018 3% Clause clause subsumption (4,020 calls)
% 0.86/1.06 ; 0.103 18% Forward simplification (1,680 calls)
% 0.86/1.06 ; 0.004 1% Backward simplification (322 calls)
% 0.86/1.06 ; 0.030 5% Ordering (20,812 calls)
% 0.86/1.06 ; 0.000 0% Sortal reasoning (32 calls)
% 0.86/1.06 ; 0.000 0% Purity testing (1 call)
% 0.86/1.06 ; 0.033 6% Other
% 0.86/1.06 ; 0.588 Total
% 0.86/1.06 ; 0.594 Real time
% 0.86/1.06 ;
% 0.86/1.06 ; Term-hash-array has 209 terms in all.
% 0.86/1.06 ; Feature-vector-row-index has 21 entries (131 at peak, 316 added, 295 deleted).
% 0.86/1.06 ; Feature-vector-row-index has 105 nodes (903 at peak, 2,238 added, 2,133 deleted).
% 0.86/1.06 ; Retrieved 10,564 possibly forward subsuming rows in 1,127 calls.
% 0.86/1.06 ; Retrieved 482 possibly backward subsumed rows in 316 calls.
% 0.86/1.06 ; Path-index has 42 entries (171 at peak, 301 added, 259 deleted).
% 0.86/1.06 ; Path-index has 70 nodes (138 at peak, 197 added, 127 deleted).
% 0.86/1.06 ; Trie-index has 42 entries (171 at peak, 301 added, 259 deleted).
% 0.86/1.06 ; Trie-index has 88 nodes (318 at peak, 537 added, 449 deleted).
% 0.86/1.06 ; Retrieved 400 generalization terms in 10,897 calls.
% 0.86/1.06 ; Retrieved 5 instance terms in 5 calls.
% 0.86/1.06 ; Retrieved 8,185 unifiable terms in 2,520 calls.
% 0.86/1.06 ;
% 0.86/1.06 ; The agenda of input rows to give has 1 entry:
% 0.86/1.06 ; 1 with value 24
% 0.86/1.06 ; The agenda of rows to give has 16 entries:
% 0.86/1.06 ; 1 with value (4 5) 2 with value (4 35) 1 with value (4 56)
% 0.86/1.06 ; 1 with value (4 6) 1 with value (4 51) 2 with value (4 57)
% 0.86/1.06 ; 1 with value (4 11) 1 with value (4 52) 1 with value (4 72)
% 0.86/1.06 ; 1 with value (4 29) 2 with value (4 55) 1 with value (4 78)
% 0.86/1.06 ; 1 with value (4 31)
% 0.86/1.06 Evaluation took:
% 0.86/1.06 0.594 seconds of real time
% 0.86/1.06 0.535197 seconds of user run time
% 0.86/1.06 0.059266 seconds of system run time
% 0.86/1.06 [Run times include 0.01 seconds GC run time.]
% 0.86/1.06 0 calls to %EVAL
% 0.86/1.06 0 page faults and
% 0.86/1.06 48,022,960 bytes consed.
% 0.86/1.06 :PROOF-FOUND
% 0.86/1.06 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T23:48:39
% 0.86/1.06 :PROOF-FOUND
% 0.86/1.06 *
%------------------------------------------------------------------------------