TSTP Solution File: SWC354+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC354+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:29:13 EDT 2024
% Result : Theorem 0.93s 0.57s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 13 unt; 0 def)
% Number of atoms : 272 ( 85 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 325 ( 127 ~; 127 |; 29 &)
% ( 3 <=>; 39 =>; 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 : 92 ( 0 sgn 55 !; 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)
& X3 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X4) = X6
& neq(nil,X4) ) )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
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(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
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(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(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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X4) = X6
& neq(nil,X4) ) )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,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)
| esk3_0 = X11
| ~ ssItem(X12)
| cons(X12,nil) != X11
| hd(esk4_0) != X12
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X11)
| esk3_0 = X11
| ~ ssItem(X12)
| cons(X12,nil) != X11
| hd(esk4_0) != X12
| ~ neq(nil,esk4_0) )
& ( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ neq(esk4_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_13])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( esk3_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(esk4_0) != X2
| ~ neq(nil,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X60,X61] :
( ~ ssList(X60)
| ~ ssItem(X61)
| ssList(cons(X61,X60)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_22,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_23,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| ~ ssList(cons(hd(esk4_0),nil))
| ~ neq(nil,esk4_0)
| ~ ssItem(hd(esk4_0)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])])])]) ).
cnf(c_0_24,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_26,plain,
! [X22] :
( ~ ssList(X22)
| nil = X22
| ssItem(hd(X22)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_29,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| ~ neq(nil,esk4_0)
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_27,c_0_17]) ).
fof(c_0_32,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_28])])])])]) ).
fof(c_0_33,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_34,plain,
! [X51,X52] :
( ~ ssList(X51)
| ~ ssItem(X52)
| hd(cons(X52,X51)) = X52 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
cnf(c_0_35,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil
| ~ neq(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_37,plain,
! [X62,X63] :
( ~ ssList(X62)
| ~ ssItem(X63)
| cons(X63,X62) != X62 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
cnf(c_0_38,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_31]),c_0_25])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( hd(esk1_0) = hd(esk4_0)
| esk4_0 = nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25])]) ).
cnf(c_0_42,negated_conjecture,
( esk4_0 = nil
| esk1_0 != nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_39]),c_0_25])]) ).
fof(c_0_43,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_44,plain,
! [X26,X27] :
( ~ ssList(X26)
| ~ ssItem(X27)
| cons(X27,X26) = app(cons(X27,nil),X26) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_45,negated_conjecture,
( hd(esk1_0) = hd(esk4_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_31])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_47,negated_conjecture,
( esk4_0 = nil
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_30]),c_0_31])]) ).
fof(c_0_48,plain,
! [X33,X34,X37,X38] :
( ( ssList(esk8_2(X33,X34))
| ~ segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) )
& ( ssList(esk9_2(X33,X34))
| ~ segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) )
& ( app(app(esk8_2(X33,X34),X34),esk9_2(X33,X34)) = X33
| ~ segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) )
& ( ~ ssList(X37)
| ~ ssList(X38)
| app(app(X37,X34),X38) != X33
| segmentP(X33,X34)
| ~ ssList(X34)
| ~ ssList(X33) ) ),
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])])])])])]) ).
fof(c_0_49,plain,
! [X59] :
( ~ ssList(X59)
| nil = X59
| cons(hd(X59),tl(X59)) = X59 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])]) ).
cnf(c_0_50,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( esk4_0 = nil
| ssItem(hd(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_45]),c_0_46])]),c_0_47]) ).
fof(c_0_52,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_53,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_48]) ).
fof(c_0_54,plain,
! [X23] :
( ~ ssList(X23)
| app(nil,X23) = X23 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_55,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])])])]) ).
cnf(c_0_56,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( cons(hd(esk4_0),X1) = app(esk1_0,X1)
| esk4_0 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_51]) ).
fof(c_0_58,plain,
! [X184] :
( ~ ssList(X184)
| nil = X184
| ssList(tl(X184)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])])]) ).
cnf(c_0_59,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_53]) ).
cnf(c_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_31])]) ).
cnf(c_0_63,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_65,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_59,c_0_60]),c_0_25])]),c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_31])]) ).
cnf(c_0_67,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_20]),c_0_17])]) ).
cnf(c_0_68,negated_conjecture,
( esk4_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_46])]),c_0_67]) ).
cnf(c_0_69,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_70,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_63]),c_0_31])]) ).
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_20,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_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC354+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:54:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/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
% 0.93/0.57 # Version: 3.1.0
% 0.93/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.57 # Starting sh5l with 300s (1) cores
% 0.93/0.57 # sh5l with pid 6185 completed with status 0
% 0.93/0.57 # Result found by sh5l
% 0.93/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.57 # Starting sh5l with 300s (1) cores
% 0.93/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.93/0.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.93/0.57 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.93/0.57 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 6188 completed with status 0
% 0.93/0.57 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.93/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.57 # Starting sh5l with 300s (1) cores
% 0.93/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.93/0.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.93/0.57 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.93/0.57 # Preprocessing time : 0.003 s
% 0.93/0.57 # Presaturation interreduction done
% 0.93/0.57
% 0.93/0.57 # Proof found!
% 0.93/0.57 # SZS status Theorem
% 0.93/0.57 # SZS output start CNFRefutation
% See solution above
% 0.93/0.57 # Parsed axioms : 96
% 0.93/0.57 # Removed by relevancy pruning/SinE : 12
% 0.93/0.57 # Initial clauses : 168
% 0.93/0.57 # Removed in clause preprocessing : 2
% 0.93/0.57 # Initial clauses in saturation : 166
% 0.93/0.57 # Processed clauses : 848
% 0.93/0.57 # ...of these trivial : 7
% 0.93/0.57 # ...subsumed : 312
% 0.93/0.57 # ...remaining for further processing : 529
% 0.93/0.57 # Other redundant clauses eliminated : 53
% 0.93/0.57 # Clauses deleted for lack of memory : 0
% 0.93/0.57 # Backward-subsumed : 25
% 0.93/0.57 # Backward-rewritten : 123
% 0.93/0.57 # Generated clauses : 1834
% 0.93/0.57 # ...of the previous two non-redundant : 1584
% 0.93/0.57 # ...aggressively subsumed : 0
% 0.93/0.57 # Contextual simplify-reflections : 114
% 0.93/0.57 # Paramodulations : 1778
% 0.93/0.57 # Factorizations : 0
% 0.93/0.57 # NegExts : 0
% 0.93/0.57 # Equation resolutions : 58
% 0.93/0.57 # Disequality decompositions : 0
% 0.93/0.57 # Total rewrite steps : 1318
% 0.93/0.57 # ...of those cached : 1298
% 0.93/0.57 # Propositional unsat checks : 0
% 0.93/0.57 # Propositional check models : 0
% 0.93/0.57 # Propositional check unsatisfiable : 0
% 0.93/0.57 # Propositional clauses : 0
% 0.93/0.57 # Propositional clauses after purity: 0
% 0.93/0.57 # Propositional unsat core size : 0
% 0.93/0.57 # Propositional preprocessing time : 0.000
% 0.93/0.57 # Propositional encoding time : 0.000
% 0.93/0.57 # Propositional solver time : 0.000
% 0.93/0.57 # Success case prop preproc time : 0.000
% 0.93/0.57 # Success case prop encoding time : 0.000
% 0.93/0.57 # Success case prop solver time : 0.000
% 0.93/0.57 # Current number of processed clauses : 205
% 0.93/0.57 # Positive orientable unit clauses : 21
% 0.93/0.57 # Positive unorientable unit clauses: 0
% 0.93/0.57 # Negative unit clauses : 2
% 0.93/0.57 # Non-unit-clauses : 182
% 0.93/0.57 # Current number of unprocessed clauses: 1043
% 0.93/0.57 # ...number of literals in the above : 6611
% 0.93/0.57 # Current number of archived formulas : 0
% 0.93/0.57 # Current number of archived clauses : 305
% 0.93/0.57 # Clause-clause subsumption calls (NU) : 22163
% 0.93/0.57 # Rec. Clause-clause subsumption calls : 7644
% 0.93/0.57 # Non-unit clause-clause subsumptions : 451
% 0.93/0.57 # Unit Clause-clause subsumption calls : 144
% 0.93/0.57 # Rewrite failures with RHS unbound : 0
% 0.93/0.57 # BW rewrite match attempts : 3
% 0.93/0.57 # BW rewrite match successes : 3
% 0.93/0.57 # Condensation attempts : 0
% 0.93/0.57 # Condensation successes : 0
% 0.93/0.57 # Termbank termtop insertions : 48754
% 0.93/0.57 # Search garbage collected termcells : 3665
% 0.93/0.57
% 0.93/0.57 # -------------------------------------------------
% 0.93/0.57 # User time : 0.084 s
% 0.93/0.57 # System time : 0.007 s
% 0.93/0.57 # Total time : 0.091 s
% 0.93/0.57 # Maximum resident set size: 2380 pages
% 0.93/0.57
% 0.93/0.57 # -------------------------------------------------
% 0.93/0.57 # User time : 0.086 s
% 0.93/0.57 # System time : 0.011 s
% 0.93/0.57 # Total time : 0.097 s
% 0.93/0.57 # Maximum resident set size: 1820 pages
% 0.93/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------