TSTP Solution File: SWV391+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV391+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 18:16:26 EDT 2022
% Result : Theorem 0.34s 19.53s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 13 unt; 0 def)
% Number of atoms : 185 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 179 ( 65 ~; 85 |; 13 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-3 aty)
% Number of variables : 235 ( 70 sgn 97 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(l27_l33,lemma,
! [X1,X2,X3,X4] :
( ok(remove_cpq(triple(X1,X2,X3),X4))
=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',l27_l33) ).
fof(l27_co,conjecture,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',l27_co) ).
fof(l27_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',l27_li4142) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax44) ).
fof(ax43,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l27_li2829,lemma,
! [X1,X2,X3] :
( pair_in_list(X1,X2,X3)
=> ! [X4] :
( contains_slb(X1,X4)
=> ( pair_in_list(remove_slb(X1,X4),X2,X3)
| X2 = X4 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',l27_li2829) ).
fof(ax37,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(bottom_smallest,axiom,
! [X1] : less_than(bottom,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
fof(l27_l30,lemma,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> ! [X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',l27_l30) ).
fof(c_0_13,plain,
! [X3,X4] : ~ ok(triple(X3,X4,bad)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax40])]) ).
fof(c_0_14,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ strictly_less_than(X8,lookup_slb(X6,X8))
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
fof(c_0_15,lemma,
! [X5,X6,X7,X8] :
( ~ ok(remove_cpq(triple(X5,X6,X7),X8))
| contains_slb(X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_l33])]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
inference(assume_negation,[status(cth)],[l27_co]) ).
cnf(c_0_17,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,lemma,
( contains_slb(X1,X2)
| ~ ok(remove_cpq(triple(X3,X1,X4),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,negated_conjecture,
( check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))
& ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))
& ~ check_cpq(triple(esk3_0,esk4_0,esk5_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_21,lemma,
! [X6,X7,X8,X9,X10,X6,X7,X8] :
( ( ~ check_cpq(triple(X6,X7,X8))
| ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9) )
& ( pair_in_list(X7,esk1_2(X6,X7),esk2_2(X6,X7))
| check_cpq(triple(X6,X7,X8)) )
& ( ~ less_than(esk2_2(X6,X7),esk1_2(X6,X7))
| check_cpq(triple(X6,X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_li4142])])])])])])]) ).
fof(c_0_22,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ less_than(lookup_slb(X6,X8),X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).
fof(c_0_23,plain,
! [X5,X6,X7,X8] :
( contains_slb(X6,X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(X5,X6,bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax43])])]) ).
cnf(c_0_24,plain,
( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X3,X4,X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])])])]) ).
fof(c_0_27,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_28,lemma,
( less_than(X1,X2)
| ~ pair_in_list(X3,X2,X1)
| ~ check_cpq(triple(X4,X3,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)
| ~ less_than(lookup_slb(X2,X4),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
~ strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,lemma,
( less_than(X1,X2)
| ~ check_cpq(remove_cpq(triple(X3,X4,X5),X6))
| ~ pair_in_list(remove_slb(X4,X6),X2,X1)
| ~ contains_slb(X4,X6)
| ~ less_than(lookup_slb(X4,X6),X6) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_36,negated_conjecture,
contains_slb(esk4_0,esk6_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_17]) ).
cnf(c_0_37,negated_conjecture,
less_than(lookup_slb(esk4_0,esk6_0),esk6_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
fof(c_0_38,lemma,
! [X5,X6,X7,X8] :
( ~ pair_in_list(X5,X6,X7)
| ~ contains_slb(X5,X8)
| pair_in_list(remove_slb(X5,X8),X6,X7)
| X6 = X8 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_li2829])])])])]) ).
cnf(c_0_39,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(X2,esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_41,lemma,
( X1 = X2
| pair_in_list(remove_slb(X3,X2),X1,X4)
| ~ contains_slb(X3,X2)
| ~ pair_in_list(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,lemma,
( pair_in_list(X1,esk1_2(X2,X1),esk2_2(X2,X1))
| less_than(X3,X4)
| ~ pair_in_list(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_43,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk2_2(X1,X2),esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_44,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| check_cpq(triple(X6,X7,X8))
| ~ less_than(X10,X9) )
& ( ~ check_cpq(triple(X6,X7,X8))
| check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
| ~ less_than(X10,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).
cnf(c_0_45,lemma,
( X1 = esk6_0
| less_than(X2,X1)
| ~ pair_in_list(esk4_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_36])]) ).
cnf(c_0_46,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(X2,esk1_2(X4,X2),esk2_2(X4,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_39]),c_0_43]) ).
cnf(c_0_47,plain,
( check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,lemma,
( esk1_2(X1,esk4_0) = esk6_0
| check_cpq(triple(X2,esk4_0,X3))
| less_than(esk2_2(X1,esk4_0),esk1_2(X1,esk4_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,lemma,
( less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5))
| ~ pair_in_list(insert_slb(X4,pair(X6,X7)),X2,X1)
| ~ less_than(X7,X6) ),
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_50,lemma,
( esk1_2(X1,esk4_0) = esk6_0
| check_cpq(triple(X2,esk4_0,X3))
| check_cpq(triple(X1,esk4_0,X4)) ),
inference(spm,[status(thm)],[c_0_43,c_0_48]) ).
cnf(c_0_51,lemma,
( check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ check_cpq(triple(X6,X2,X7))
| ~ less_than(X4,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_39]),c_0_43]) ).
cnf(c_0_52,lemma,
( esk1_2(X1,esk4_0) = esk6_0
| check_cpq(triple(X1,esk4_0,X2)) ),
inference(ef,[status(thm)],[c_0_50]) ).
fof(c_0_53,plain,
! [X2] : less_than(bottom,X2),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
cnf(c_0_54,lemma,
( esk1_2(X1,esk4_0) = esk6_0
| check_cpq(triple(X2,insert_slb(esk4_0,pair(X3,X4)),X5))
| ~ less_than(X4,X3) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,plain,
( check_cpq(triple(X3,X4,X5))
| ~ less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_57,lemma,
( esk1_2(X1,esk4_0) = esk6_0
| check_cpq(triple(X2,insert_slb(esk4_0,pair(X3,bottom)),X4)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
fof(c_0_58,lemma,
! [X6,X7,X8,X9,X10] :
( ~ check_cpq(remove_cpq(triple(X6,X7,X8),X9))
| ~ ok(remove_cpq(triple(X6,X7,X8),X9))
| ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l27_l30])])])])]) ).
cnf(c_0_59,lemma,
( esk1_2(X1,esk4_0) = esk6_0
| check_cpq(triple(X2,esk4_0,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_55])]) ).
cnf(c_0_60,lemma,
( less_than(X1,X2)
| ~ pair_in_list(X3,X2,X1)
| ~ ok(remove_cpq(triple(X4,X3,X5),X2))
| ~ check_cpq(remove_cpq(triple(X4,X3,X5),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_61,lemma,
( check_cpq(triple(X1,esk4_0,X2))
| check_cpq(triple(X3,esk4_0,X4))
| pair_in_list(esk4_0,esk6_0,esk2_2(X5,esk4_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( less_than(X1,esk6_0)
| ~ pair_in_list(esk4_0,esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_25]),c_0_35])]) ).
cnf(c_0_63,lemma,
( check_cpq(triple(X1,esk4_0,X2))
| pair_in_list(esk4_0,esk6_0,esk2_2(X3,esk4_0)) ),
inference(ef,[status(thm)],[c_0_61]) ).
cnf(c_0_64,lemma,
( check_cpq(triple(X1,esk4_0,X2))
| check_cpq(triple(X3,esk4_0,X4))
| ~ less_than(esk2_2(X3,esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( check_cpq(triple(X1,esk4_0,X2))
| less_than(esk2_2(X3,esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,lemma,
( check_cpq(triple(X1,esk4_0,X2))
| check_cpq(triple(X3,esk4_0,X4))
| check_cpq(triple(X5,esk4_0,X6)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_67,lemma,
( check_cpq(triple(X1,esk4_0,X2))
| check_cpq(triple(X3,esk4_0,X4)) ),
inference(ef,[status(thm)],[c_0_66]) ).
cnf(c_0_68,negated_conjecture,
~ check_cpq(triple(esk3_0,esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_69,lemma,
check_cpq(triple(X1,esk4_0,X2)),
inference(ef,[status(thm)],[c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV391+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n004.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jun 15 17:50:39 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.34/19.53 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.34/19.53 # Preprocessing time : 0.018 s
% 0.34/19.53
% 0.34/19.53 # Proof found!
% 0.34/19.53 # SZS status Theorem
% 0.34/19.53 # SZS output start CNFRefutation
% See solution above
% 0.34/19.53 # Proof object total steps : 71
% 0.34/19.53 # Proof object clause steps : 44
% 0.34/19.53 # Proof object formula steps : 27
% 0.34/19.53 # Proof object conjectures : 13
% 0.34/19.53 # Proof object clause conjectures : 10
% 0.34/19.53 # Proof object formula conjectures : 3
% 0.34/19.53 # Proof object initial clauses used : 18
% 0.34/19.53 # Proof object initial formulas used : 13
% 0.34/19.53 # Proof object generating inferences : 25
% 0.34/19.53 # Proof object simplifying inferences : 16
% 0.34/19.53 # Training examples: 0 positive, 0 negative
% 0.34/19.53 # Parsed axioms : 46
% 0.34/19.53 # Removed by relevancy pruning/SinE : 0
% 0.34/19.53 # Initial clauses : 59
% 0.34/19.53 # Removed in clause preprocessing : 2
% 0.34/19.53 # Initial clauses in saturation : 57
% 0.34/19.53 # Processed clauses : 12952
% 0.34/19.53 # ...of these trivial : 8
% 0.34/19.53 # ...subsumed : 8129
% 0.34/19.53 # ...remaining for further processing : 4815
% 0.34/19.53 # Other redundant clauses eliminated : 3
% 0.34/19.53 # Clauses deleted for lack of memory : 494570
% 0.34/19.53 # Backward-subsumed : 161
% 0.34/19.53 # Backward-rewritten : 21
% 0.34/19.53 # Generated clauses : 638150
% 0.34/19.53 # ...of the previous two non-trivial : 615072
% 0.34/19.53 # Contextual simplify-reflections : 11158
% 0.34/19.53 # Paramodulations : 637053
% 0.34/19.53 # Factorizations : 1094
% 0.34/19.53 # Equation resolutions : 4
% 0.34/19.53 # Current number of processed clauses : 4631
% 0.34/19.53 # Positive orientable unit clauses : 41
% 0.34/19.53 # Positive unorientable unit clauses: 0
% 0.34/19.53 # Negative unit clauses : 1308
% 0.34/19.53 # Non-unit-clauses : 3282
% 0.34/19.53 # Current number of unprocessed clauses: 95874
% 0.34/19.53 # ...number of literals in the above : 637400
% 0.34/19.53 # Current number of archived formulas : 0
% 0.34/19.53 # Current number of archived clauses : 184
% 0.34/19.53 # Clause-clause subsumption calls (NU) : 3097291
% 0.34/19.53 # Rec. Clause-clause subsumption calls : 727537
% 0.34/19.53 # Non-unit clause-clause subsumptions : 17867
% 0.34/19.53 # Unit Clause-clause subsumption calls : 550367
% 0.34/19.53 # Rewrite failures with RHS unbound : 0
% 0.34/19.53 # BW rewrite match attempts : 191
% 0.34/19.53 # BW rewrite match successes : 6
% 0.34/19.53 # Condensation attempts : 0
% 0.34/19.53 # Condensation successes : 0
% 0.34/19.53 # Termbank termtop insertions : 21531724
% 0.34/19.53
% 0.34/19.53 # -------------------------------------------------
% 0.34/19.53 # User time : 18.781 s
% 0.34/19.53 # System time : 0.134 s
% 0.34/19.53 # Total time : 18.915 s
% 0.34/19.53 # Maximum resident set size: 145400 pages
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.40 eprover: CPU time limit exceeded, terminating
% 0.34/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.41 eprover: No such file or directory
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------