TSTP Solution File: SWC193+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC193+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:59 EDT 2023
% Result : Theorem 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 28 unt; 0 def)
% Number of atoms : 240 ( 62 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 270 ( 100 ~; 103 |; 26 &)
% ( 4 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn; 57 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| X5 = X6 ) ) ) ) )
| ( ~ singletonP(X3)
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax81) ).
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/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax27) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax73) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax4) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax15) ).
fof(ax14,axiom,
! [X1] :
( ssList(X1)
=> ( equalelemsP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,cons(X2,cons(X3,X5))) = X1
=> X2 = X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax14) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax58) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p',ax74) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| X5 = X6 ) ) ) ) )
| ( ~ singletonP(X3)
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_13,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& segmentP(esk51_0,esk50_0)
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& esk52_0 != esk53_0
& ( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X224,X225,X226] :
( ~ ssList(X224)
| ~ ssList(X225)
| ~ ssList(X226)
| app(app(X224,X225),X226) = app(X224,app(X225,X226)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_17,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X113,X114] :
( ~ ssList(X113)
| ~ ssItem(X114)
| ssList(cons(X114,X113)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_21,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_27,plain,
! [X222,X223] :
( ~ ssList(X222)
| ~ ssItem(X223)
| cons(X223,X222) = app(cons(X223,nil),X222) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_28,negated_conjecture,
app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_23]),c_0_26])]) ).
cnf(c_0_29,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
| ~ ssList(cons(esk52_0,cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_31]),c_0_32]),c_0_19])]) ).
cnf(c_0_34,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_26])]) ).
fof(c_0_35,plain,
! [X134,X135,X136] :
( ~ ssList(X134)
| ~ ssList(X135)
| ~ ssItem(X136)
| cons(X136,app(X135,X134)) = app(cons(X136,X135),X134) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_36,negated_conjecture,
app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_37,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_38,plain,
! [X208] :
( ~ ssItem(X208)
| equalelemsP(cons(X208,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
fof(c_0_39,plain,
! [X19,X21] :
( ( ssItem(esk5_1(X19))
| ~ singletonP(X19)
| ~ ssList(X19) )
& ( cons(esk5_1(X19),nil) = X19
| ~ singletonP(X19)
| ~ ssList(X19) )
& ( ~ ssItem(X21)
| cons(X21,nil) != X19
| singletonP(X19)
| ~ ssList(X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
fof(c_0_40,plain,
! [X111,X112] :
( ( ~ neq(X111,X112)
| X111 != X112
| ~ ssList(X112)
| ~ ssList(X111) )
& ( X111 = X112
| neq(X111,X112)
| ~ ssList(X112)
| ~ ssList(X111) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_43,plain,
! [X102,X103,X104,X105,X106] :
( ( ~ equalelemsP(X102)
| ~ ssItem(X103)
| ~ ssItem(X104)
| ~ ssList(X105)
| ~ ssList(X106)
| app(X105,cons(X103,cons(X104,X106))) != X102
| X103 = X104
| ~ ssList(X102) )
& ( ssItem(esk40_1(X102))
| equalelemsP(X102)
| ~ ssList(X102) )
& ( ssItem(esk41_1(X102))
| equalelemsP(X102)
| ~ ssList(X102) )
& ( ssList(esk42_1(X102))
| equalelemsP(X102)
| ~ ssList(X102) )
& ( ssList(esk43_1(X102))
| equalelemsP(X102)
| ~ ssList(X102) )
& ( app(esk42_1(X102),cons(esk40_1(X102),cons(esk41_1(X102),esk43_1(X102)))) = X102
| equalelemsP(X102)
| ~ ssList(X102) )
& ( esk40_1(X102) != esk41_1(X102)
| equalelemsP(X102)
| ~ ssList(X102) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])])])]) ).
cnf(c_0_44,negated_conjecture,
( app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]),c_0_26])]) ).
cnf(c_0_45,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_49,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_52,plain,
( X2 = X3
| ~ equalelemsP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(X4,cons(X2,cons(X3,X5))) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_53,negated_conjecture,
app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_54,plain,
( equalelemsP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_55,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_23]),c_0_50])]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_51,c_0_15]) ).
cnf(c_0_57,plain,
( X1 = X2
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_58,negated_conjecture,
app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_29]),c_0_32]),c_0_24])]) ).
cnf(c_0_59,negated_conjecture,
esk52_0 != esk53_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_60,negated_conjecture,
( esk51_0 = nil
| equalelemsP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_61,negated_conjecture,
~ equalelemsP(esk50_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_56]),c_0_32]),c_0_19]),c_0_24]),c_0_26])]),c_0_59]) ).
fof(c_0_62,plain,
! [X197] :
( ( ~ segmentP(nil,X197)
| nil = X197
| ~ ssList(X197) )
& ( nil != X197
| segmentP(nil,X197)
| ~ ssList(X197) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_63,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_64,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_66,negated_conjecture,
segmentP(nil,esk50_0),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_56])]) ).
cnf(c_0_68,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_67]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC193+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n006.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 : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 01:46:55 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.KB7yAjN8eV/E---3.1_25065.p
% 0.19/0.54 # Version: 3.1pre001
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 25142 completed with status 0
% 0.19/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.19/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 25157 completed with status 0
% 0.19/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.19/0.54 # Preprocessing time : 0.003 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Theorem
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 96
% 0.19/0.54 # Removed by relevancy pruning/SinE : 0
% 0.19/0.54 # Initial clauses : 204
% 0.19/0.54 # Removed in clause preprocessing : 2
% 0.19/0.54 # Initial clauses in saturation : 202
% 0.19/0.54 # Processed clauses : 596
% 0.19/0.54 # ...of these trivial : 3
% 0.19/0.54 # ...subsumed : 78
% 0.19/0.54 # ...remaining for further processing : 515
% 0.19/0.54 # Other redundant clauses eliminated : 57
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 8
% 0.19/0.54 # Backward-rewritten : 73
% 0.19/0.54 # Generated clauses : 926
% 0.19/0.54 # ...of the previous two non-redundant : 798
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 30
% 0.19/0.54 # Paramodulations : 865
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 62
% 0.19/0.54 # Total rewrite steps : 545
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 214
% 0.19/0.54 # Positive orientable unit clauses : 23
% 0.19/0.54 # Positive unorientable unit clauses: 0
% 0.19/0.54 # Negative unit clauses : 3
% 0.19/0.54 # Non-unit-clauses : 188
% 0.19/0.54 # Current number of unprocessed clauses: 599
% 0.19/0.54 # ...number of literals in the above : 3534
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 278
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 21034
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 5882
% 0.19/0.54 # Non-unit clause-clause subsumptions : 113
% 0.19/0.54 # Unit Clause-clause subsumption calls : 178
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 22
% 0.19/0.54 # BW rewrite match successes : 17
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 33116
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.049 s
% 0.19/0.54 # System time : 0.006 s
% 0.19/0.54 # Total time : 0.055 s
% 0.19/0.54 # Maximum resident set size: 2512 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.200 s
% 0.19/0.54 # System time : 0.027 s
% 0.19/0.54 # Total time : 0.228 s
% 0.19/0.54 # Maximum resident set size: 1800 pages
% 0.19/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------