TSTP Solution File: SWC178+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC178+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:28:09 EDT 2024
% Result : Theorem 0.93s 0.59s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 26 unt; 0 def)
% Number of atoms : 267 ( 57 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 308 ( 112 ~; 110 |; 28 &)
% ( 8 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 71 !; 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 ) )
| neq(X5,X6) ) ) )
| ( ~ singletonP(X3)
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax1) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax13,axiom,
! [X1] :
( ssList(X1)
=> ( duplicatefreeP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> X2 != X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax13) ).
fof(ax71,axiom,
! [X1] :
( ssItem(X1)
=> duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax71) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax72,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax72) ).
fof(c_0_13,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 ) )
| neq(X5,X6) ) ) )
| ( ~ singletonP(X3)
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_15,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
& ~ neq(esk52_0,esk53_0)
& ( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_16,plain,
! [X9,X10] :
( ( ~ neq(X9,X10)
| X9 != X10
| ~ ssItem(X10)
| ~ ssItem(X9) )
& ( X9 = X10
| neq(X9,X10)
| ~ ssItem(X10)
| ~ ssItem(X9) ) ),
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_14])])])])]) ).
cnf(c_0_17,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_15]) ).
cnf(c_0_18,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X224,X225,X226] :
( ~ ssList(X224)
| ~ ssList(X225)
| ~ ssList(X226)
| app(app(X224,X225),X226) = app(X224,app(X225,X226)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_20,negated_conjecture,
~ neq(esk52_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,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_17,c_0_18]) ).
cnf(c_0_25,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_28,plain,
! [X113,X114] :
( ~ ssList(X113)
| ~ ssItem(X114)
| ssList(cons(X114,X113)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_29,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_26])]) ).
cnf(c_0_30,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_32,plain,
! [X132,X133] :
( ~ ssList(X132)
| ~ ssList(X133)
| ssList(app(X132,X133)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_33,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_34,plain,
! [X1] :
( ssList(X1)
=> ( duplicatefreeP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> X2 != X3 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ax13]) ).
cnf(c_0_35,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_23])]) ).
cnf(c_0_36,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_38,plain,
! [X207] :
( ~ ssItem(X207)
| duplicatefreeP(cons(X207,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax71])])]) ).
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(fof_nnf,[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(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_41,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_43,plain,
! [X91,X92,X93,X94,X95,X96] :
( ( ~ duplicatefreeP(X91)
| ~ ssItem(X92)
| ~ ssItem(X93)
| ~ ssList(X94)
| ~ ssList(X95)
| ~ ssList(X96)
| app(app(X94,cons(X92,X95)),cons(X93,X96)) != X91
| X92 != X93
| ~ ssList(X91) )
& ( ssItem(esk35_1(X91))
| duplicatefreeP(X91)
| ~ ssList(X91) )
& ( ssItem(esk36_1(X91))
| duplicatefreeP(X91)
| ~ ssList(X91) )
& ( ssList(esk37_1(X91))
| duplicatefreeP(X91)
| ~ ssList(X91) )
& ( ssList(esk38_1(X91))
| duplicatefreeP(X91)
| ~ ssList(X91) )
& ( ssList(esk39_1(X91))
| duplicatefreeP(X91)
| ~ ssList(X91) )
& ( app(app(esk37_1(X91),cons(esk35_1(X91),esk38_1(X91))),cons(esk36_1(X91),esk39_1(X91))) = X91
| duplicatefreeP(X91)
| ~ ssList(X91) )
& ( esk35_1(X91) = esk36_1(X91)
| duplicatefreeP(X91)
| ~ ssList(X91) ) ),
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_34])])])])])]) ).
cnf(c_0_44,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
fof(c_0_45,plain,
! [X222,X223] :
( ~ ssList(X222)
| ~ ssItem(X223)
| cons(X223,X222) = app(cons(X223,nil),X222) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_46,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_50,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_51,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_53,plain,
( ~ duplicatefreeP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| X2 != X3
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,negated_conjecture,
app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_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_30]),c_0_31]),c_0_23])]) ).
cnf(c_0_55,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,plain,
( duplicatefreeP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_57,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_49,c_0_50]),c_0_31]),c_0_51])]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_52,c_0_18]) ).
cnf(c_0_59,plain,
( ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_53])]) ).
cnf(c_0_60,negated_conjecture,
app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_27]),c_0_23])]) ).
cnf(c_0_61,negated_conjecture,
( esk51_0 = nil
| duplicatefreeP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_62,negated_conjecture,
~ duplicatefreeP(esk50_0),
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_59,c_0_60]),c_0_58]),c_0_27]),c_0_31]),c_0_37]),c_0_23])]) ).
fof(c_0_63,plain,
! [X197] :
( ( ~ segmentP(nil,X197)
| nil = X197
| ~ ssList(X197) )
& ( nil != X197
| segmentP(nil,X197)
| ~ ssList(X197) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_64,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_65,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,negated_conjecture,
segmentP(nil,esk50_0),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_58])]) ).
cnf(c_0_69,plain,
duplicatefreeP(nil),
inference(split_conjunct,[status(thm)],[ax72]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_68]),c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC178+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:47:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.59 # Version: 3.1.0
% 0.93/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.59 # Starting sh5l with 300s (1) cores
% 0.93/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21656 completed with status 0
% 0.93/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.93/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.59 # No SInE strategy applied
% 0.93/0.59 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.93/0.59 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.59 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.93/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.93/0.59 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.93/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.93/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.93/0.59 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 21667 completed with status 0
% 0.93/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.93/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.59 # No SInE strategy applied
% 0.93/0.59 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.93/0.59 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.59 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.93/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.93/0.59 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.93/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.93/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.93/0.59 # Preprocessing time : 0.004 s
% 0.93/0.59 # Presaturation interreduction done
% 0.93/0.59
% 0.93/0.59 # Proof found!
% 0.93/0.59 # SZS status Theorem
% 0.93/0.59 # SZS output start CNFRefutation
% See solution above
% 0.93/0.59 # Parsed axioms : 96
% 0.93/0.59 # Removed by relevancy pruning/SinE : 0
% 0.93/0.59 # Initial clauses : 204
% 0.93/0.59 # Removed in clause preprocessing : 2
% 0.93/0.59 # Initial clauses in saturation : 202
% 0.93/0.59 # Processed clauses : 717
% 0.93/0.59 # ...of these trivial : 18
% 0.93/0.59 # ...subsumed : 94
% 0.93/0.59 # ...remaining for further processing : 605
% 0.93/0.59 # Other redundant clauses eliminated : 59
% 0.93/0.59 # Clauses deleted for lack of memory : 0
% 0.93/0.59 # Backward-subsumed : 13
% 0.93/0.59 # Backward-rewritten : 159
% 0.93/0.59 # Generated clauses : 1377
% 0.93/0.59 # ...of the previous two non-redundant : 1178
% 0.93/0.59 # ...aggressively subsumed : 0
% 0.93/0.59 # Contextual simplify-reflections : 15
% 0.93/0.59 # Paramodulations : 1314
% 0.93/0.59 # Factorizations : 0
% 0.93/0.59 # NegExts : 0
% 0.93/0.59 # Equation resolutions : 64
% 0.93/0.59 # Disequality decompositions : 0
% 0.93/0.59 # Total rewrite steps : 1136
% 0.93/0.59 # ...of those cached : 1086
% 0.93/0.59 # Propositional unsat checks : 0
% 0.93/0.59 # Propositional check models : 0
% 0.93/0.59 # Propositional check unsatisfiable : 0
% 0.93/0.59 # Propositional clauses : 0
% 0.93/0.59 # Propositional clauses after purity: 0
% 0.93/0.59 # Propositional unsat core size : 0
% 0.93/0.59 # Propositional preprocessing time : 0.000
% 0.93/0.59 # Propositional encoding time : 0.000
% 0.93/0.59 # Propositional solver time : 0.000
% 0.93/0.59 # Success case prop preproc time : 0.000
% 0.93/0.59 # Success case prop encoding time : 0.000
% 0.93/0.59 # Success case prop solver time : 0.000
% 0.93/0.59 # Current number of processed clauses : 213
% 0.93/0.59 # Positive orientable unit clauses : 23
% 0.93/0.59 # Positive unorientable unit clauses: 0
% 0.93/0.59 # Negative unit clauses : 3
% 0.93/0.59 # Non-unit-clauses : 187
% 0.93/0.59 # Current number of unprocessed clauses: 854
% 0.93/0.59 # ...number of literals in the above : 4699
% 0.93/0.59 # Current number of archived formulas : 0
% 0.93/0.59 # Current number of archived clauses : 369
% 0.93/0.59 # Clause-clause subsumption calls (NU) : 23496
% 0.93/0.59 # Rec. Clause-clause subsumption calls : 8165
% 0.93/0.59 # Non-unit clause-clause subsumptions : 120
% 0.93/0.59 # Unit Clause-clause subsumption calls : 325
% 0.93/0.59 # Rewrite failures with RHS unbound : 0
% 0.93/0.59 # BW rewrite match attempts : 54
% 0.93/0.59 # BW rewrite match successes : 30
% 0.93/0.59 # Condensation attempts : 0
% 0.93/0.59 # Condensation successes : 0
% 0.93/0.59 # Termbank termtop insertions : 45478
% 0.93/0.59 # Search garbage collected termcells : 4307
% 0.93/0.59
% 0.93/0.59 # -------------------------------------------------
% 0.93/0.59 # User time : 0.084 s
% 0.93/0.59 # System time : 0.008 s
% 0.93/0.59 # Total time : 0.092 s
% 0.93/0.59 # Maximum resident set size: 2480 pages
% 0.93/0.59
% 0.93/0.59 # -------------------------------------------------
% 0.93/0.59 # User time : 0.392 s
% 0.93/0.59 # System time : 0.026 s
% 0.93/0.59 # Total time : 0.419 s
% 0.93/0.59 # Maximum resident set size: 1824 pages
% 0.93/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------