TSTP Solution File: SWC120+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC120+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:45 EDT 2024
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 12 unt; 0 def)
% Number of atoms : 279 ( 81 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 339 ( 134 ~; 133 |; 31 &)
% ( 3 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 53 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
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(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] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| ( 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,
! [X11,X12] :
( 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)
| ~ ssList(X11)
| esk4_0 = X11
| ~ ssList(X12)
| tl(esk4_0) != X12
| app(esk3_0,X12) != X11
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X11)
| esk4_0 = X11
| ~ ssList(X12)
| tl(esk4_0) != X12
| app(esk3_0,X12) != X11
| ~ neq(nil,esk4_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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_15,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_16,plain,
! [X22,X23,X26,X27] :
( ( ssList(esk7_2(X22,X23))
| ~ segmentP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( ssList(esk8_2(X22,X23))
| ~ segmentP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( app(app(esk7_2(X22,X23),X23),esk8_2(X22,X23)) = X22
| ~ segmentP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( ~ ssList(X26)
| ~ ssList(X27)
| app(app(X26,X23),X27) != X22
| segmentP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) ) ),
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_17,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X15,X16] :
( ( ~ neq(X15,X16)
| X15 != X16
| ~ ssList(X16)
| ~ ssList(X15) )
& ( X15 = X16
| neq(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) ) ),
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_15])])])])]) ).
cnf(c_0_20,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_16]) ).
fof(c_0_21,plain,
! [X45] :
( ~ ssList(X45)
| app(nil,X45) = X45 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_22,plain,
! [X40,X41] :
( ~ ssList(X40)
| ~ ssList(X41)
| ssList(app(X40,X41)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_23,negated_conjecture,
( esk4_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| tl(esk4_0) != X2
| app(esk3_0,X2) != X1
| ~ neq(nil,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk2_0),
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,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,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_20]) ).
cnf(c_0_32,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| ~ ssList(app(esk1_0,tl(esk4_0)))
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])])])]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_36,plain,
! [X60] :
( ~ ssList(X60)
| nil = X60
| ssList(tl(X60)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_27,c_0_18]) ).
fof(c_0_38,plain,
! [X74,X75] :
( ~ ssList(X74)
| ~ ssItem(X75)
| cons(X75,X74) != X74 ),
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_39,plain,
! [X42,X43,X44] :
( ~ ssList(X42)
| ~ ssList(X43)
| ~ ssItem(X44)
| cons(X44,app(X43,X42)) = app(cons(X44,X43),X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_40,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_41,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_42,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
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_31,c_0_32]),c_0_30])]),c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_33]),c_0_35])]) ).
cnf(c_0_46,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,negated_conjecture,
( X1 = esk4_0
| neq(X1,esk4_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_37]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_50,plain,
! [X52,X53] :
( ~ ssList(X52)
| ~ ssItem(X53)
| cons(X53,X52) = app(cons(X53,nil),X52) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_51,plain,
! [X67] :
( ~ ssList(X67)
| nil = X67
| cons(hd(X67),tl(X67)) = X67 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])]) ).
fof(c_0_52,plain,
! [X80] :
( ~ ssList(X80)
| nil = X80
| ssItem(hd(X80)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])]) ).
cnf(c_0_53,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_25]),c_0_18])]) ).
cnf(c_0_54,negated_conjecture,
( esk1_0 = nil
| neq(esk1_0,nil) ),
inference(spm,[status(thm)],[c_0_43,c_0_35]) ).
cnf(c_0_55,negated_conjecture,
( segmentP(esk4_0,esk1_0)
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35])]) ).
cnf(c_0_56,negated_conjecture,
( esk4_0 = nil
| ssList(tl(esk4_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_37]) ).
cnf(c_0_57,negated_conjecture,
( esk4_0 = nil
| neq(nil,esk4_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_30]) ).
cnf(c_0_58,plain,
( app(cons(X1,X2),X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_33]) ).
cnf(c_0_59,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( esk1_0 = nil
| ~ segmentP(esk4_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
( esk4_0 = nil
| segmentP(esk4_0,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_64,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_30])]) ).
cnf(c_0_65,negated_conjecture,
( cons(hd(esk4_0),tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_60,c_0_37]) ).
cnf(c_0_66,negated_conjecture,
( esk4_0 = nil
| ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_61,c_0_37]) ).
cnf(c_0_67,negated_conjecture,
( esk4_0 = nil
| esk1_0 = nil ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( esk4_0 = nil
| app(nil,tl(esk4_0)) != esk4_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_56]) ).
cnf(c_0_69,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_70,negated_conjecture,
esk4_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_67]),c_0_57]),c_0_56]),c_0_68]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_72,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_25,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SWC120+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun May 19 03:49:22 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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
% 0.15/0.46 # Version: 3.1.0
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # new_bool_3 with pid 26850 completed with status 0
% 0.15/0.46 # Result found by new_bool_3
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26853 completed with status 0
% 0.15/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.46 # Preprocessing time : 0.002 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status Theorem
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 96
% 0.15/0.46 # Removed by relevancy pruning/SinE : 60
% 0.15/0.46 # Initial clauses : 62
% 0.15/0.46 # Removed in clause preprocessing : 0
% 0.15/0.46 # Initial clauses in saturation : 62
% 0.15/0.46 # Processed clauses : 370
% 0.15/0.46 # ...of these trivial : 5
% 0.15/0.46 # ...subsumed : 85
% 0.15/0.46 # ...remaining for further processing : 280
% 0.15/0.46 # Other redundant clauses eliminated : 14
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 2
% 0.15/0.46 # Backward-rewritten : 80
% 0.15/0.46 # Generated clauses : 1212
% 0.15/0.46 # ...of the previous two non-redundant : 1190
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 51
% 0.15/0.46 # Paramodulations : 1196
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 18
% 0.15/0.46 # Disequality decompositions : 0
% 0.15/0.46 # Total rewrite steps : 400
% 0.15/0.46 # ...of those cached : 390
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 135
% 0.15/0.46 # Positive orientable unit clauses : 12
% 0.15/0.46 # Positive unorientable unit clauses: 0
% 0.15/0.46 # Negative unit clauses : 1
% 0.15/0.46 # Non-unit-clauses : 122
% 0.15/0.46 # Current number of unprocessed clauses: 937
% 0.15/0.46 # ...number of literals in the above : 4598
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 139
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 8550
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 2168
% 0.15/0.46 # Non-unit clause-clause subsumptions : 138
% 0.15/0.46 # Unit Clause-clause subsumption calls : 205
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 2
% 0.15/0.46 # BW rewrite match successes : 2
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 25291
% 0.15/0.46 # Search garbage collected termcells : 1730
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.040 s
% 0.15/0.46 # System time : 0.001 s
% 0.15/0.46 # Total time : 0.041 s
% 0.15/0.46 # Maximum resident set size: 2056 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.043 s
% 0.15/0.46 # System time : 0.003 s
% 0.15/0.46 # Total time : 0.046 s
% 0.15/0.46 # Maximum resident set size: 1824 pages
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------