TSTP Solution File: SWV282-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWV282-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n012.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 : Wed Jul 20 21:32:32 EDT 2022
% Result : Unsatisfiable 2.94s 3.11s
% Output : Refutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of clauses : 51 ( 26 unt; 18 nHn; 26 RR)
% Number of literals : 99 ( 60 equ; 21 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 67 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
( X = Y
| Z = Y
| X = Z
| c_in(c_Message_Omsg_ONonce(Y),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(Z),c_Event_Oused(v_evs_H),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(v_evs),tc_Message_Omsg) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Binomial_Obinomial__1_0,axiom,
c_Binomial_Obinomial(X,c_Suc(c_0)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Binomial_Obinomial__1_0) ).
cnf(cls_Binomial_Obinomial__Suc__Suc_0,axiom,
c_Binomial_Obinomial(c_Suc(X),c_Suc(Y)) = c_plus(c_Binomial_Obinomial(X,Y),c_Binomial_Obinomial(X,c_Suc(Y)),tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Binomial_Obinomial__Suc__Suc_0) ).
cnf(cls_Binomial_Obinomial__n__0_0,axiom,
c_Binomial_Obinomial(X,c_0) = c_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Binomial_Obinomial__n__0_0) ).
cnf(cls_Nat_OOne__nat__def_0,axiom,
c_1 = c_Suc(c_0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_OOne__nat__def_0) ).
cnf(cls_Nat_Odiff__is__0__eq_0,axiom,
( c_minus(X,Y,tc_nat) != c_0
| c_lessequals(X,Y,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Odiff__is__0__eq_0) ).
cnf(cls_Nat_Odiff__self__eq__0_0,axiom,
c_minus(X,X,tc_nat) = c_0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Odiff__self__eq__0_0) ).
cnf(cls_Nat_Ole__add1_0,axiom,
c_lessequals(X,c_plus(X,Y,tc_nat),tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Ole__add1_0) ).
cnf(cls_Nat_OlessI_0,axiom,
c_less(X,c_Suc(X),tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_OlessI_0) ).
cnf(cls_Nat_Oless__Suc__eq__le_1,axiom,
( ~ c_lessequals(X,Y,tc_nat)
| c_less(X,c_Suc(Y),tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Oless__Suc__eq__le_1) ).
cnf(cls_Nat_Onat__add__left__cancel__le_0,axiom,
( ~ c_lessequals(c_plus(X,Y,tc_nat),c_plus(X,Z,tc_nat),tc_nat)
| c_lessequals(Y,Z,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Onat__add__left__cancel__le_0) ).
cnf(cls_Nat_Onot__add__less2_0,axiom,
~ c_less(c_plus(X,Y,tc_nat),Y,tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Onot__add__less2_0) ).
cnf(cls_Public_ONonce__supply__lemma_0,axiom,
( ~ c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(Y),tc_Message_Omsg)
| ~ c_lessequals(v_sko__urX(Y),X,tc_nat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Public_ONonce__supply__lemma_0) ).
cnf(15,plain,
c_Binomial_Obinomial(X,c_1) = X,
inference('REWRITE',[status(thm)],[cls_Binomial_Obinomial__1_0,cls_Nat_OOne__nat__def_0,theory(equality)]) ).
cnf(17,plain,
c_less(X,c_Suc(c_plus(X,Y,tc_nat)),tc_nat),
inference('HYPERRESOLVE',[status(thm)],[cls_Nat_Oless__Suc__eq__le_1,cls_Nat_Ole__add1_0]) ).
cnf(18,plain,
~ c_lessequals(c_plus(X,c_Suc(Y),tc_nat),Y,tc_nat),
inference('UR-RESOLVE',[status(thm)],[cls_Nat_Oless__Suc__eq__le_1,cls_Nat_Onot__add__less2_0]) ).
cnf(19,plain,
c_lessequals(X,X,tc_nat),
inference('HYPERRESOLVE',[status(thm)],[cls_Nat_Odiff__is__0__eq_0,cls_Nat_Odiff__self__eq__0_0]) ).
cnf(23,plain,
c_Suc(X) = c_plus(c_1,X,tc_nat),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_Binomial_Obinomial__Suc__Suc_0,cls_Nat_OOne__nat__def_0,theory(equality)]),cls_Binomial_Obinomial__n__0_0,15,theory(equality)]) ).
cnf(31,plain,
( X = v_sko__urX(v_evs_H_H)
| Y = v_sko__urX(v_evs_H_H)
| X = Y
| c_in(c_Message_Omsg_ONonce(Y),c_Event_Oused(v_evs_H),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(v_evs),tc_Message_Omsg) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Public_ONonce__supply__lemma_0,19,cls_conjecture_0]) ).
cnf(34,plain,
~ c_less(c_Suc(X),X,tc_nat),
inference('PARAMODULATE',[status(thm)],[cls_Nat_Onot__add__less2_0,23,theory(equality)]) ).
cnf(36,plain,
( ~ c_lessequals(c_Suc(X),c_Suc(Y),tc_nat)
| c_lessequals(X,Y,tc_nat) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_Nat_Onat__add__left__cancel__le_0,23,theory(equality)]),23,theory(equality)]) ).
cnf(38,plain,
~ c_lessequals(c_Suc(c_Suc(X)),X,tc_nat),
inference('UR-RESOLVE',[status(thm)],[cls_Nat_Oless__Suc__eq__le_1,34]) ).
cnf(41,plain,
~ c_lessequals(c_plus(X,c_1,tc_nat),c_0,tc_nat),
inference('PARAMODULATE',[status(thm)],[18,cls_Nat_OOne__nat__def_0,theory(equality)]) ).
cnf(44,plain,
~ c_lessequals(c_Suc(c_1),c_0,tc_nat),
inference('PARAMODULATE',[status(thm)],[41,23,theory(equality)]) ).
cnf(48,plain,
~ c_lessequals(c_plus(X,c_Suc(c_1),tc_nat),c_plus(X,c_0,tc_nat),tc_nat),
inference('UR-RESOLVE',[status(thm)],[cls_Nat_Onat__add__left__cancel__le_0,44]) ).
cnf(50,plain,
~ c_lessequals(c_plus(X,c_Suc(c_Suc(Y)),tc_nat),c_plus(X,Y,tc_nat),tc_nat),
inference('UR-RESOLVE',[status(thm)],[cls_Nat_Onat__add__left__cancel__le_0,38]) ).
cnf(65,plain,
~ c_lessequals(c_Suc(c_plus(X,c_Suc(Y),tc_nat)),c_Suc(Y),tc_nat),
inference('UR-RESOLVE',[status(thm)],[36,18]) ).
cnf(72,plain,
~ c_lessequals(c_plus(X,c_Suc(c_plus(Y,c_Suc(Z),tc_nat)),tc_nat),c_plus(X,c_Suc(Z),tc_nat),tc_nat),
inference('UR-RESOLVE',[status(thm)],[cls_Nat_Onat__add__left__cancel__le_0,65]) ).
cnf(424,plain,
( X = v_sko__urX(v_evs_H_H)
| v_sko__urX(v_evs_H) = v_sko__urX(v_evs_H_H)
| X = v_sko__urX(v_evs_H)
| c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(v_evs),tc_Message_Omsg) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Public_ONonce__supply__lemma_0,31,19]) ).
cnf(425,plain,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
| X = v_sko__urX(v_evs_H_H)
| v_sko__urX(v_evs) = X
| c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(v_evs_H),tc_Message_Omsg) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Public_ONonce__supply__lemma_0,31,19]) ).
cnf(426,plain,
( X = v_sko__urX(v_evs_H_H)
| c_plus(v_sko__urX(v_evs_H),Y,tc_nat) = v_sko__urX(v_evs_H_H)
| X = c_plus(v_sko__urX(v_evs_H),Y,tc_nat)
| c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(v_evs),tc_Message_Omsg) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Public_ONonce__supply__lemma_0,31,cls_Nat_Ole__add1_0]) ).
cnf(431,plain,
( c_plus(v_sko__urX(v_evs),X,tc_nat) = v_sko__urX(v_evs_H_H)
| v_sko__urX(v_evs_H) = v_sko__urX(v_evs_H_H)
| c_plus(v_sko__urX(v_evs),X,tc_nat) = v_sko__urX(v_evs_H) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Public_ONonce__supply__lemma_0,424,cls_Nat_Ole__add1_0]) ).
cnf(438,plain,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
| c_plus(v_sko__urX(v_evs_H),X,tc_nat) = v_sko__urX(v_evs_H_H)
| v_sko__urX(v_evs) = c_plus(v_sko__urX(v_evs_H),X,tc_nat) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Public_ONonce__supply__lemma_0,425,cls_Nat_Ole__add1_0]) ).
cnf(440,plain,
( v_sko__urX(v_evs_H) = v_sko__urX(v_evs_H_H)
| c_plus(v_sko__urX(v_evs),X,tc_nat) = v_sko__urX(v_evs_H)
| ~ c_less(v_sko__urX(v_evs_H_H),X,tc_nat) ),
inference('PARAMODULATE',[status(thm)],[cls_Nat_Onot__add__less2_0,431,theory(equality)]) ).
cnf(706,plain,
( v_sko__urX(v_evs_H) = v_sko__urX(v_evs_H_H)
| c_plus(v_sko__urX(v_evs),c_Suc(v_sko__urX(v_evs_H_H)),tc_nat) = v_sko__urX(v_evs_H) ),
inference('HYPERRESOLVE',[status(thm)],[440,cls_Nat_OlessI_0]) ).
cnf(707,plain,
( v_sko__urX(v_evs_H) = v_sko__urX(v_evs_H_H)
| c_plus(v_sko__urX(v_evs),c_Suc(c_plus(v_sko__urX(v_evs_H_H),X,tc_nat)),tc_nat) = v_sko__urX(v_evs_H) ),
inference('HYPERRESOLVE',[status(thm)],[440,17]) ).
cnf(784,plain,
( v_sko__urX(v_evs_H) = v_sko__urX(v_evs_H_H)
| ~ c_lessequals(v_sko__urX(v_evs_H),c_plus(v_sko__urX(v_evs),c_Suc(X),tc_nat),tc_nat) ),
inference('PARAMODULATE',[status(thm)],[72,707,theory(equality)]) ).
cnf(864,plain,
v_sko__urX(v_evs_H) = v_sko__urX(v_evs_H_H),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[784,706,theory(equality)]),19]) ).
cnf(869,plain,
( X = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs_H),Y,tc_nat) = v_sko__urX(v_evs_H)
| X = c_plus(v_sko__urX(v_evs_H),Y,tc_nat)
| c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(v_evs),tc_Message_Omsg) ),
inference('REWRITE',[status(thm)],[426,864,theory(equality)]) ).
cnf(877,plain,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs_H),X,tc_nat) = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = c_plus(v_sko__urX(v_evs_H),X,tc_nat) ),
inference('REWRITE',[status(thm)],[438,864,theory(equality)]) ).
cnf(893,plain,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = c_plus(v_sko__urX(v_evs_H),c_Suc(c_1),tc_nat) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[48,877,theory(equality)]),cls_Nat_Ole__add1_0]) ).
cnf(901,plain,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = c_plus(v_sko__urX(v_evs_H),c_Suc(c_Suc(X)),tc_nat) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[50,877,theory(equality)]),cls_Nat_Ole__add1_0]) ).
cnf(1172,plain,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| ~ c_lessequals(v_sko__urX(v_evs),c_plus(v_sko__urX(v_evs_H),X,tc_nat),tc_nat) ),
inference('PARAMODULATE',[status(thm)],[50,901,theory(equality)]) ).
cnf(1251,plain,
v_sko__urX(v_evs) = v_sko__urX(v_evs_H),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1172,893,theory(equality)]),19]) ).
cnf(1259,plain,
( v_sko__urX(v_evs) = X
| c_plus(v_sko__urX(v_evs),Y,tc_nat) = v_sko__urX(v_evs)
| X = c_plus(v_sko__urX(v_evs),Y,tc_nat)
| c_in(c_Message_Omsg_ONonce(X),c_Event_Oused(v_evs),tc_Message_Omsg) ),
inference('REWRITE',[status(thm)],[869,1251,theory(equality)]) ).
cnf(1573,plain,
( c_plus(v_sko__urX(v_evs),X,tc_nat) = v_sko__urX(v_evs)
| c_plus(v_sko__urX(v_evs),Y,tc_nat) = v_sko__urX(v_evs)
| c_plus(v_sko__urX(v_evs),X,tc_nat) = c_plus(v_sko__urX(v_evs),Y,tc_nat) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Public_ONonce__supply__lemma_0,1259,cls_Nat_Ole__add1_0]) ).
cnf(1864,plain,
( c_plus(v_sko__urX(v_evs),X,tc_nat) = v_sko__urX(v_evs)
| c_plus(v_sko__urX(v_evs),Y,tc_nat) = v_sko__urX(v_evs)
| ~ c_less(c_plus(v_sko__urX(v_evs),Y,tc_nat),X,tc_nat) ),
inference('PARAMODULATE',[status(thm)],[cls_Nat_Onot__add__less2_0,1573,theory(equality)]) ).
cnf(2854,plain,
( c_plus(v_sko__urX(v_evs),c_Suc(c_plus(v_sko__urX(v_evs),X,tc_nat)),tc_nat) = v_sko__urX(v_evs)
| c_plus(v_sko__urX(v_evs),X,tc_nat) = v_sko__urX(v_evs) ),
inference('HYPERRESOLVE',[status(thm)],[1864,cls_Nat_OlessI_0]) ).
cnf(2878,plain,
c_plus(v_sko__urX(v_evs),X,tc_nat) = v_sko__urX(v_evs),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,2854,theory(equality)]),cls_Nat_Ole__add1_0]) ).
cnf(2880,plain,
~ c_lessequals(v_sko__urX(v_evs),X,tc_nat),
inference('PARAMODULATE',[status(thm)],[18,2878,theory(equality)]) ).
cnf(2881,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_Nat_Ole__add1_0,2878,theory(equality)]),2880]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV282-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n012.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 : Wed Jun 15 13:09:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T13:09:10
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n012.cluster.edu at 2022-06-15T13:09:10
% 0.19/0.48
% 2.94/3.11 ; Recognized possible right inverse assertion (|c_less| ?X (|c_Suc| ?X) |tc_nat|).
% 2.94/3.11
% 2.94/3.11 #||
% 2.94/3.11 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.11 % SZS output start Refutation
% See solution above
% 2.94/3.12 ||#
% 2.94/3.12
% 2.94/3.12 ; Summary of computation:
% 2.94/3.12 ; 9145 formulas have been input or derived (from 515 formulas).
% 2.94/3.12 ; 2881 (32%) were retained. Of these,
% 2.94/3.12 ; 1862 (65%) were simplified or subsumed later,
% 2.94/3.12 ; 1019 (35%) are still being kept.
% 2.94/3.12 ;
% 2.94/3.12 ; Run time in seconds excluding printing time:
% 2.94/3.12 ; 0.003 0% Read assertion file (1 call)
% 2.94/3.12 ; 0.001 0% Assert (14 calls)
% 2.94/3.12 ; 0.391 15% Process new row (8,104 calls)
% 2.94/3.12 ; 0.772 29% Resolution (1,028 calls)
% 2.94/3.12 ; 0.142 5% Paramodulation (514 calls)
% 2.94/3.12 ; 0.000 0% Factoring (26 calls)
% 2.94/3.12 ; 0.052 2% Condensing (3,163 calls)
% 2.94/3.12 ; 0.591 22% Forward subsumption (3,163 calls)
% 2.94/3.12 ; 0.104 4% Backward subsumption (1,886 calls)
% 2.94/3.12 ; 0.014 1% Clause clause subsumption (4,430 calls)
% 2.94/3.12 ; 0.350 13% Forward simplification (7,847 calls)
% 2.94/3.12 ; 0.161 6% Backward simplification (2,881 calls)
% 2.94/3.12 ; 0.015 1% Ordering (13,622 calls)
% 2.94/3.12 ; 0.000 0% Sortal reasoning (32 calls)
% 2.94/3.12 ; 0.000 0% Purity testing (1 call)
% 2.94/3.12 ; 0.054 2% Other
% 2.94/3.12 ; 2.650 Total
% 2.94/3.12 ; 2.654 Real time
% 2.94/3.12 ;
% 2.94/3.12 ; Term-hash-array has 6,838 terms in all.
% 2.94/3.12 ; Feature-vector-row-index has 34 entries (1,038 at peak, 1,886 added, 1,852 deleted).
% 2.94/3.12 ; Feature-vector-row-index has 350 nodes (17,181 at peak, 30,927 added, 30,577 deleted).
% 2.94/3.12 ; Retrieved 6,547 possibly forward subsuming rows in 3,163 calls.
% 2.94/3.12 ; Retrieved 258 possibly backward subsumed rows in 1,886 calls.
% 2.94/3.12 ; Path-index has 2,969 entries (5,269 at peak, 7,030 added, 4,061 deleted).
% 2.94/3.12 ; Path-index has 11,012 nodes (11,605 at peak, 12,703 added, 1,691 deleted).
% 2.94/3.12 ; Trie-index has 2,969 entries (5,269 at peak, 7,030 added, 4,061 deleted).
% 2.94/3.12 ; Trie-index has 28,594 nodes (43,374 at peak, 53,040 added, 24,446 deleted).
% 2.94/3.12 ; Retrieved 18,604 generalization terms in 92,225 calls.
% 2.94/3.12 ; Retrieved 1,207 instance terms in 994 calls.
% 2.94/3.12 ; Retrieved 381,073 unifiable terms in 101,393 calls.
% 2.94/3.12 ;
% 2.94/3.12 ; The agenda of rows to process has 976 entries:
% 2.94/3.12 ; 1 with value 17 53 with value 27 52 with value 35
% 2.94/3.12 ; 5 with value 18 47 with value 28 56 with value 36
% 2.94/3.12 ; 6 with value 20 63 with value 29 88 with value 37
% 2.94/3.12 ; 6 with value 21 74 with value 30 46 with value 38
% 2.94/3.12 ; 4 with value 22 65 with value 31 24 with value 39
% 2.94/3.12 ; 21 with value 23 76 with value 32 19 with value 40
% 2.94/3.12 ; 12 with value 24 106 with value 33 7 with value 41
% 2.94/3.12 ; 27 with value 25 79 with value 34 4 with value 42
% 2.94/3.12 ; 35 with value 26
% 2.94/3.12 ; The agenda of rows to give has 564 entries:
% 2.94/3.12 ; 2 with value (4 15) 34 with value (4 45) 1 with value (4 50)
% 2.94/3.12 ; 45 with value (4 41) 40 with value (4 46) 27 with value (4 51)
% 2.94/3.12 ; 80 with value (4 42) 67 with value (4 47) 16 with value (4 52)
% 2.94/3.12 ; 79 with value (4 43) 40 with value (4 48) 26 with value (4 56)
% 2.94/3.12 ; 78 with value (4 44) 29 with value (4 49)
% 2.94/3.12 Evaluation took:
% 2.94/3.12 2.655 seconds of real time
% 2.94/3.12 2.532 seconds of user run time
% 2.94/3.12 0.122763 seconds of system run time
% 2.94/3.12 [Run times include 0.315 seconds GC run time.]
% 2.94/3.12 0 calls to %EVAL
% 2.94/3.12 0 page faults and
% 2.94/3.12 296,995,608 bytes consed.
% 2.94/3.12 :PROOF-FOUND
% 2.94/3.12 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T13:09:12
% 2.94/3.12 :PROOF-FOUND
% 2.94/3.12 *
%------------------------------------------------------------------------------