TSTP Solution File: SWC126+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC126+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 300s
% DateTime : Tue May 21 04:27:50 EDT 2024
% Result : Theorem 18.82s 2.87s
% Output : CNFRefutation 18.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 68 ( 17 unt; 0 def)
% Number of atoms : 264 ( 43 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 329 ( 133 ~; 127 |; 31 &)
% ( 4 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 56 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_13,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| cons(esk5_0,nil) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| cons(esk5_0,nil) = esk3_0 )
& ( neq(esk2_0,nil)
| memberP(esk4_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| memberP(esk4_0,esk5_0) )
& ( neq(esk2_0,nil)
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_14,plain,
! [X27,X28,X31,X32] :
( ( ssList(esk8_2(X27,X28))
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ssList(esk9_2(X27,X28))
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( app(app(esk8_2(X27,X28),X28),esk9_2(X27,X28)) = X27
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ~ ssList(X31)
| ~ ssList(X32)
| app(app(X31,X28),X32) != X27
| segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X21] :
( ~ ssList(X21)
| app(nil,X21) = X21 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_18,plain,
! [X83,X84] :
( ~ ssList(X83)
| ~ ssList(X84)
| ssList(app(X83,X84)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_19,plain,
! [X22,X23] :
( ~ ssList(X22)
| ~ ssItem(X23)
| cons(X23,X22) = app(cons(X23,nil),X22) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_20,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_25,plain,
! [X26] :
( ~ ssList(X26)
| app(X26,nil) = X26 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_26,plain,
! [X45,X46,X49,X50] :
( ( ssList(esk10_2(X45,X46))
| ~ memberP(X45,X46)
| ~ ssItem(X46)
| ~ ssList(X45) )
& ( ssList(esk11_2(X45,X46))
| ~ memberP(X45,X46)
| ~ ssItem(X46)
| ~ ssList(X45) )
& ( app(esk10_2(X45,X46),cons(X46,esk11_2(X45,X46))) = X45
| ~ memberP(X45,X46)
| ~ ssItem(X46)
| ~ ssList(X45) )
& ( ~ ssList(X49)
| ~ ssList(X50)
| app(X49,cons(X46,X50)) != X45
| memberP(X45,X46)
| ~ ssItem(X46)
| ~ ssList(X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])])]) ).
cnf(c_0_27,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_28,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_29,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_30,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_32,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,negated_conjecture,
cons(esk5_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_22]),c_0_23])]) ).
cnf(c_0_36,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
( app(esk10_2(X1,X2),cons(X2,esk11_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,negated_conjecture,
memberP(esk2_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_22]),c_0_22]),c_0_23])]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,plain,
( ssList(esk10_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_41,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_42,plain,
! [X60,X61] :
( ~ ssList(X60)
| ~ ssItem(X61)
| cons(X61,X60) != X60 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
fof(c_0_43,plain,
! [X33,X34,X35] :
( ~ ssList(X33)
| ~ ssList(X34)
| ~ ssList(X35)
| ~ segmentP(X33,X34)
| ~ segmentP(X34,X35)
| segmentP(X33,X35) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_44,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_45,negated_conjecture,
( app(esk1_0,X1) = cons(esk5_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_36]),c_0_31])]),c_0_32]) ).
cnf(c_0_48,negated_conjecture,
app(esk10_2(esk2_0,esk5_0),cons(esk5_0,esk11_2(esk2_0,esk5_0))) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_35])]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk10_2(esk2_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_38]),c_0_39]),c_0_35])]) ).
fof(c_0_50,plain,
! [X58,X59] :
( ~ ssList(X58)
| ~ ssItem(X59)
| ssList(cons(X59,X58)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_51,plain,
( ssList(esk11_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_52,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_53,plain,
! [X14,X15] :
( ( ~ neq(X14,X15)
| X14 != X15
| ~ ssList(X15)
| ~ ssList(X14) )
& ( X14 = X15
| neq(X14,X15)
| ~ ssList(X15)
| ~ ssList(X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_55,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_56,negated_conjecture,
( segmentP(cons(esk5_0,X1),esk1_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_57,negated_conjecture,
( ssList(cons(esk5_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_46])]) ).
cnf(c_0_58,negated_conjecture,
( segmentP(esk2_0,cons(esk5_0,esk11_2(esk2_0,esk5_0)))
| ~ ssList(cons(esk5_0,esk11_2(esk2_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_59,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,negated_conjecture,
ssList(esk11_2(esk2_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_38]),c_0_39]),c_0_35])]) ).
cnf(c_0_61,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_22]),c_0_23])]) ).
cnf(c_0_62,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_34]),c_0_31]),c_0_35])]) ).
cnf(c_0_64,negated_conjecture,
( segmentP(X1,esk1_0)
| ~ segmentP(X1,cons(esk5_0,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_46])]),c_0_57]) ).
cnf(c_0_65,negated_conjecture,
segmentP(esk2_0,cons(esk5_0,esk11_2(esk2_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_35])]) ).
cnf(c_0_66,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_31]),c_0_46])]),c_0_63]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_39]),c_0_60])]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC126+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 02:55:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.82/2.87 # Version: 3.1.0
% 18.82/2.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.82/2.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.82/2.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.82/2.87 # Starting new_bool_3 with 300s (1) cores
% 18.82/2.87 # Starting new_bool_1 with 300s (1) cores
% 18.82/2.87 # Starting sh5l with 300s (1) cores
% 18.82/2.87 # sh5l with pid 18020 completed with status 0
% 18.82/2.87 # Result found by sh5l
% 18.82/2.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.82/2.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.82/2.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.82/2.87 # Starting new_bool_3 with 300s (1) cores
% 18.82/2.87 # Starting new_bool_1 with 300s (1) cores
% 18.82/2.87 # Starting sh5l with 300s (1) cores
% 18.82/2.87 # SinE strategy is gf500_gu_R04_F100_L20000
% 18.82/2.87 # Search class: FGHSF-FSLM21-MFFFFFNN
% 18.82/2.87 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 18.82/2.87 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 18.82/2.87 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 18027 completed with status 0
% 18.82/2.87 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 18.82/2.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.82/2.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.82/2.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.82/2.87 # Starting new_bool_3 with 300s (1) cores
% 18.82/2.87 # Starting new_bool_1 with 300s (1) cores
% 18.82/2.87 # Starting sh5l with 300s (1) cores
% 18.82/2.87 # SinE strategy is gf500_gu_R04_F100_L20000
% 18.82/2.87 # Search class: FGHSF-FSLM21-MFFFFFNN
% 18.82/2.87 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 18.82/2.87 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 18.82/2.87 # Preprocessing time : 0.002 s
% 18.82/2.87 # Presaturation interreduction done
% 18.82/2.87
% 18.82/2.87 # Proof found!
% 18.82/2.87 # SZS status Theorem
% 18.82/2.87 # SZS output start CNFRefutation
% See solution above
% 18.82/2.87 # Parsed axioms : 96
% 18.82/2.87 # Removed by relevancy pruning/SinE : 8
% 18.82/2.87 # Initial clauses : 183
% 18.82/2.87 # Removed in clause preprocessing : 2
% 18.82/2.87 # Initial clauses in saturation : 181
% 18.82/2.87 # Processed clauses : 18310
% 18.82/2.87 # ...of these trivial : 227
% 18.82/2.87 # ...subsumed : 13780
% 18.82/2.87 # ...remaining for further processing : 4303
% 18.82/2.87 # Other redundant clauses eliminated : 513
% 18.82/2.87 # Clauses deleted for lack of memory : 0
% 18.82/2.87 # Backward-subsumed : 191
% 18.82/2.87 # Backward-rewritten : 404
% 18.82/2.87 # Generated clauses : 110524
% 18.82/2.87 # ...of the previous two non-redundant : 100037
% 18.82/2.87 # ...aggressively subsumed : 0
% 18.82/2.87 # Contextual simplify-reflections : 1323
% 18.82/2.87 # Paramodulations : 109980
% 18.82/2.87 # Factorizations : 4
% 18.82/2.87 # NegExts : 0
% 18.82/2.87 # Equation resolutions : 541
% 18.82/2.87 # Disequality decompositions : 0
% 18.82/2.87 # Total rewrite steps : 133631
% 18.82/2.87 # ...of those cached : 133062
% 18.82/2.87 # Propositional unsat checks : 0
% 18.82/2.87 # Propositional check models : 0
% 18.82/2.87 # Propositional check unsatisfiable : 0
% 18.82/2.87 # Propositional clauses : 0
% 18.82/2.87 # Propositional clauses after purity: 0
% 18.82/2.87 # Propositional unsat core size : 0
% 18.82/2.87 # Propositional preprocessing time : 0.000
% 18.82/2.87 # Propositional encoding time : 0.000
% 18.82/2.87 # Propositional solver time : 0.000
% 18.82/2.87 # Success case prop preproc time : 0.000
% 18.82/2.87 # Success case prop encoding time : 0.000
% 18.82/2.87 # Success case prop solver time : 0.000
% 18.82/2.87 # Current number of processed clauses : 3518
% 18.82/2.87 # Positive orientable unit clauses : 625
% 18.82/2.87 # Positive unorientable unit clauses: 0
% 18.82/2.87 # Negative unit clauses : 499
% 18.82/2.87 # Non-unit-clauses : 2394
% 18.82/2.87 # Current number of unprocessed clauses: 81138
% 18.82/2.87 # ...number of literals in the above : 506335
% 18.82/2.87 # Current number of archived formulas : 0
% 18.82/2.87 # Current number of archived clauses : 765
% 18.82/2.87 # Clause-clause subsumption calls (NU) : 1250344
% 18.82/2.87 # Rec. Clause-clause subsumption calls : 288902
% 18.82/2.87 # Non-unit clause-clause subsumptions : 8014
% 18.82/2.87 # Unit Clause-clause subsumption calls : 58309
% 18.82/2.87 # Rewrite failures with RHS unbound : 0
% 18.82/2.87 # BW rewrite match attempts : 1880
% 18.82/2.87 # BW rewrite match successes : 139
% 18.82/2.87 # Condensation attempts : 0
% 18.82/2.87 # Condensation successes : 0
% 18.82/2.87 # Termbank termtop insertions : 2934195
% 18.82/2.87 # Search garbage collected termcells : 3883
% 18.82/2.87
% 18.82/2.87 # -------------------------------------------------
% 18.82/2.87 # User time : 2.205 s
% 18.82/2.87 # System time : 0.055 s
% 18.82/2.87 # Total time : 2.260 s
% 18.82/2.87 # Maximum resident set size: 2428 pages
% 18.82/2.87
% 18.82/2.87 # -------------------------------------------------
% 18.82/2.87 # User time : 2.208 s
% 18.82/2.87 # System time : 0.057 s
% 18.82/2.87 # Total time : 2.265 s
% 18.82/2.87 # Maximum resident set size: 1824 pages
% 18.82/2.87 % E---3.1 exiting
%------------------------------------------------------------------------------