TSTP Solution File: SWC090+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC090+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:23:13 EDT 2024
% Result : Theorem 0.64s 0.56s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 23 unt; 0 def)
% Number of atoms : 252 ( 84 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 293 ( 118 ~; 113 |; 26 &)
% ( 4 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 51 !; 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] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X6,X7) != X4
| app(X7,X6) != X3 ) ) ) ) ) ) ) ),
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(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X6,X7) != X4
| app(X7,X6) != X3 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_13,negated_conjecture,
! [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)
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12) )
& ssList(esk5_0)
& ssList(esk6_0)
& app(esk5_0,esk6_0) = esk4_0
& app(esk6_0,esk5_0) = esk3_0 ),
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_11])])])])]) ).
fof(c_0_14,plain,
! [X55,X56] :
( ( ~ neq(X55,X56)
| X55 != X56
| ~ ssList(X56)
| ~ ssList(X55) )
& ( X55 = X56
| neq(X55,X56)
| ~ ssList(X56)
| ~ ssList(X55) ) ),
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_12])])])])]) ).
fof(c_0_15,plain,
! [X35,X36,X39,X40] :
( ( ssList(esk7_2(X35,X36))
| ~ segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) )
& ( ssList(esk8_2(X35,X36))
| ~ segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) )
& ( app(app(esk7_2(X35,X36),X36),esk8_2(X35,X36)) = X35
| ~ segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) )
& ( ~ ssList(X39)
| ~ ssList(X40)
| app(app(X39,X36),X40) != X35
| segmentP(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) ) ),
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_16,plain,
! [X32,X33] :
( ( nil = X33
| nil != app(X32,X33)
| ~ ssList(X33)
| ~ ssList(X32) )
& ( nil = X32
| nil != app(X32,X33)
| ~ ssList(X33)
| ~ ssList(X32) )
& ( nil != X33
| nil != X32
| nil = app(X32,X33)
| ~ ssList(X33)
| ~ ssList(X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_17,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_21,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_15]) ).
cnf(c_0_22,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
app(esk5_0,esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
app(esk6_0,esk5_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_28,plain,
! [X29,X30,X31] :
( ~ ssList(X29)
| ~ ssList(X30)
| ~ ssList(X31)
| app(app(X29,X30),X31) = app(X29,app(X30,X31)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_29,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_30,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_21]) ).
fof(c_0_31,plain,
! [X34] :
( ~ ssList(X34)
| app(X34,nil) = X34 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_32,plain,
! [X20] :
( ~ ssList(X20)
| app(nil,X20) = X20 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_33,plain,
! [X15,X16] :
( ~ ssList(X15)
| ~ ssList(X16)
| ssList(app(X15,X16)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_34,negated_conjecture,
( esk6_0 = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_35,negated_conjecture,
app(esk6_0,esk5_0) = esk1_0,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_36,plain,
! [X24,X25,X26] :
( ~ ssList(X24)
| ~ ssList(X25)
| ~ ssList(X26)
| app(X25,X26) != app(X25,X24)
| X26 = X24 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_37,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,negated_conjecture,
( esk6_0 = nil
| neq(esk6_0,nil) ),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_40,negated_conjecture,
( segmentP(app(esk2_0,X1),esk6_0)
| ~ ssList(app(esk2_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_25]),c_0_24])]) ).
cnf(c_0_41,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( app(esk5_0,nil) = esk2_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
( app(nil,esk5_0) = esk1_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_47,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,negated_conjecture,
( app(esk6_0,app(esk5_0,X1)) = app(esk1_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_24]),c_0_25])]) ).
cnf(c_0_49,negated_conjecture,
( esk6_0 = nil
| ~ segmentP(esk1_0,esk6_0)
| ~ segmentP(esk2_0,esk6_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_50,negated_conjecture,
segmentP(esk2_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_20])]) ).
cnf(c_0_51,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_30,c_0_43]),c_0_20])]),c_0_44]) ).
cnf(c_0_52,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_53,negated_conjecture,
( esk5_0 = esk2_0
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_45]),c_0_24])]) ).
cnf(c_0_54,negated_conjecture,
( esk5_0 = esk1_0
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_46]),c_0_24])]) ).
cnf(c_0_55,negated_conjecture,
( esk5_0 = nil
| neq(esk5_0,nil) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_56,negated_conjecture,
( segmentP(app(esk1_0,X1),esk5_0)
| ~ ssList(app(esk1_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_35]),c_0_24]),c_0_25])]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_58,negated_conjecture,
( X1 = esk5_0
| app(esk6_0,X1) != esk1_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_24]),c_0_25])]) ).
cnf(c_0_59,negated_conjecture,
app(esk6_0,esk2_0) = app(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_23]),c_0_25])]) ).
cnf(c_0_60,negated_conjecture,
( esk6_0 = nil
| ~ segmentP(esk1_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_61,negated_conjecture,
segmentP(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_35]),c_0_25]),c_0_24])]) ).
cnf(c_0_62,negated_conjecture,
( ~ segmentP(esk1_0,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_42])]) ).
cnf(c_0_63,negated_conjecture,
( esk1_0 = esk2_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
fof(c_0_64,plain,
! [X46] :
( ~ ssList(X46)
| segmentP(X46,X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_65,negated_conjecture,
( esk5_0 = nil
| ~ segmentP(esk1_0,esk5_0)
| ~ segmentP(esk2_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_55]),c_0_24])]) ).
cnf(c_0_66,negated_conjecture,
segmentP(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_41]),c_0_57]),c_0_20])]) ).
cnf(c_0_67,negated_conjecture,
( esk5_0 = esk2_0
| app(esk1_0,esk6_0) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_42])]) ).
cnf(c_0_68,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_69,negated_conjecture,
app(esk1_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_41]),c_0_35]),c_0_20]),c_0_24])]) ).
cnf(c_0_70,negated_conjecture,
( esk2_0 != nil
| ~ segmentP(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_72,negated_conjecture,
( esk5_0 = nil
| ~ segmentP(esk2_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_73,negated_conjecture,
esk5_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_42])]) ).
cnf(c_0_75,negated_conjecture,
~ segmentP(esk2_0,esk2_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_73]),c_0_74]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_71]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC090+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.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 02:44:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.56 # Version: 3.1.0
% 0.64/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.56 # Starting sh5l with 300s (1) cores
% 0.64/0.56 # new_bool_3 with pid 14956 completed with status 0
% 0.64/0.56 # Result found by new_bool_3
% 0.64/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.64/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.64/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14962 completed with status 0
% 0.64/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.64/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.64/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.64/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.64/0.56 # Preprocessing time : 0.002 s
% 0.64/0.56 # Presaturation interreduction done
% 0.64/0.56
% 0.64/0.56 # Proof found!
% 0.64/0.56 # SZS status Theorem
% 0.64/0.56 # SZS output start CNFRefutation
% See solution above
% 0.64/0.56 # Parsed axioms : 96
% 0.64/0.56 # Removed by relevancy pruning/SinE : 70
% 0.64/0.56 # Initial clauses : 50
% 0.64/0.56 # Removed in clause preprocessing : 0
% 0.64/0.56 # Initial clauses in saturation : 50
% 0.64/0.56 # Processed clauses : 670
% 0.64/0.56 # ...of these trivial : 39
% 0.64/0.56 # ...subsumed : 244
% 0.64/0.56 # ...remaining for further processing : 387
% 0.64/0.56 # Other redundant clauses eliminated : 19
% 0.64/0.56 # Clauses deleted for lack of memory : 0
% 0.64/0.56 # Backward-subsumed : 50
% 0.64/0.56 # Backward-rewritten : 158
% 0.64/0.56 # Generated clauses : 2133
% 0.64/0.56 # ...of the previous two non-redundant : 1992
% 0.64/0.56 # ...aggressively subsumed : 0
% 0.64/0.56 # Contextual simplify-reflections : 16
% 0.64/0.56 # Paramodulations : 2109
% 0.64/0.56 # Factorizations : 0
% 0.64/0.56 # NegExts : 0
% 0.64/0.56 # Equation resolutions : 23
% 0.64/0.56 # Disequality decompositions : 0
% 0.64/0.56 # Total rewrite steps : 2270
% 0.64/0.56 # ...of those cached : 2235
% 0.64/0.56 # Propositional unsat checks : 0
% 0.64/0.56 # Propositional check models : 0
% 0.64/0.56 # Propositional check unsatisfiable : 0
% 0.64/0.56 # Propositional clauses : 0
% 0.64/0.56 # Propositional clauses after purity: 0
% 0.64/0.56 # Propositional unsat core size : 0
% 0.64/0.56 # Propositional preprocessing time : 0.000
% 0.64/0.56 # Propositional encoding time : 0.000
% 0.64/0.56 # Propositional solver time : 0.000
% 0.64/0.56 # Success case prop preproc time : 0.000
% 0.64/0.56 # Success case prop encoding time : 0.000
% 0.64/0.56 # Success case prop solver time : 0.000
% 0.64/0.56 # Current number of processed clauses : 124
% 0.64/0.56 # Positive orientable unit clauses : 29
% 0.64/0.56 # Positive unorientable unit clauses: 0
% 0.64/0.56 # Negative unit clauses : 5
% 0.64/0.56 # Non-unit-clauses : 90
% 0.64/0.56 # Current number of unprocessed clauses: 1357
% 0.64/0.56 # ...number of literals in the above : 6111
% 0.64/0.56 # Current number of archived formulas : 0
% 0.64/0.56 # Current number of archived clauses : 258
% 0.64/0.56 # Clause-clause subsumption calls (NU) : 10230
% 0.64/0.56 # Rec. Clause-clause subsumption calls : 5550
% 0.64/0.56 # Non-unit clause-clause subsumptions : 198
% 0.64/0.56 # Unit Clause-clause subsumption calls : 785
% 0.64/0.56 # Rewrite failures with RHS unbound : 0
% 0.64/0.56 # BW rewrite match attempts : 11
% 0.64/0.56 # BW rewrite match successes : 9
% 0.64/0.56 # Condensation attempts : 0
% 0.64/0.56 # Condensation successes : 0
% 0.64/0.56 # Termbank termtop insertions : 36659
% 0.64/0.56 # Search garbage collected termcells : 1536
% 0.64/0.56
% 0.64/0.56 # -------------------------------------------------
% 0.64/0.56 # User time : 0.060 s
% 0.64/0.56 # System time : 0.006 s
% 0.64/0.56 # Total time : 0.066 s
% 0.64/0.56 # Maximum resident set size: 1912 pages
% 0.64/0.56
% 0.64/0.56 # -------------------------------------------------
% 0.64/0.56 # User time : 0.063 s
% 0.64/0.56 # System time : 0.009 s
% 0.64/0.56 # Total time : 0.072 s
% 0.64/0.56 # Maximum resident set size: 1828 pages
% 0.64/0.56 % E---3.1 exiting
% 0.64/0.56 % E exiting
%------------------------------------------------------------------------------