TSTP Solution File: SWC354+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n019.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:26:01 EDT 2024
% Result : Theorem 0.68s 0.56s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 13 unt; 0 def)
% Number of atoms : 261 ( 71 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 316 ( 125 ~; 125 |; 25 &)
% ( 2 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 87 ( 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)
& 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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax53) ).
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(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
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(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)
& 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_13,negated_conjecture,
! [X255,X256] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( neq(esk49_0,nil)
| neq(esk49_0,nil) )
& ( ~ neq(esk51_0,nil)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ ssList(X255)
| esk50_0 = X255
| ~ ssItem(X256)
| cons(X256,nil) != X255
| hd(esk51_0) != X256
| ~ neq(nil,esk51_0) )
& ( ~ neq(esk51_0,nil)
| ~ ssList(X255)
| esk50_0 = X255
| ~ ssItem(X256)
| cons(X256,nil) != X255
| hd(esk51_0) != X256
| ~ neq(nil,esk51_0) )
& ( neq(esk49_0,nil)
| ~ segmentP(esk49_0,esk48_0) )
& ( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_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(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_18,negated_conjecture,
( esk50_0 = X1
| ~ neq(esk51_0,nil)
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(esk51_0) != X2
| ~ neq(nil,esk51_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X109,X110] :
( ( ~ neq(X109,X110)
| X109 != X110
| ~ ssList(X110)
| ~ ssList(X109) )
& ( X109 = X110
| neq(X109,X110)
| ~ ssList(X110)
| ~ ssList(X109) ) ),
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_17])])])])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_24,negated_conjecture,
( cons(hd(esk51_0),nil) = esk48_0
| ~ ssList(cons(hd(esk51_0),nil))
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_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_25,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,plain,
! [X124] :
( ~ ssList(X124)
| nil = X124
| ssItem(hd(X124)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_29,negated_conjecture,
( cons(hd(esk51_0),nil) = esk48_0
| esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[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])]) ).
cnf(c_0_30,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X111,X112] :
( ~ ssList(X111)
| ~ ssItem(X112)
| ssList(cons(X112,X111)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_32,negated_conjecture,
( cons(hd(esk51_0),nil) = esk48_0
| esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26])]) ).
cnf(c_0_33,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_35,plain,
! [X184,X185,X186] :
( ~ ssList(X184)
| ~ ssList(X185)
| ~ ssList(X186)
| ~ segmentP(X184,X185)
| ~ segmentP(X185,X186)
| segmentP(X184,X186) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
fof(c_0_36,plain,
! [X220,X221] :
( ~ ssList(X220)
| ~ ssItem(X221)
| cons(X221,X220) = app(cons(X221,nil),X220) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_37,negated_conjecture,
( cons(hd(esk51_0),nil) = esk48_0
| esk51_0 = nil
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27])]) ).
cnf(c_0_38,negated_conjecture,
~ segmentP(esk51_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_20]),c_0_16])]) ).
cnf(c_0_39,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_41,plain,
! [X190,X191,X192,X193] :
( ~ ssList(X190)
| ~ ssList(X191)
| ~ ssList(X192)
| ~ ssList(X193)
| ~ segmentP(X190,X191)
| segmentP(app(app(X192,X190),X193),X191) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_42,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_43,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( cons(hd(esk51_0),nil) = esk48_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_30]),c_0_26])]) ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(X1,esk48_0)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_26])]) ).
cnf(c_0_46,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_47,plain,
! [X189] :
( ~ ssList(X189)
| segmentP(X189,X189) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
fof(c_0_48,plain,
! [X213] :
( ~ ssList(X213)
| nil = X213
| cons(hd(X213),tl(X213)) = X213 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
cnf(c_0_49,negated_conjecture,
( cons(hd(esk51_0),X1) = app(esk48_0,X1)
| esk51_0 = nil
| ~ ssList(X1)
| ~ ssItem(hd(esk51_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_50,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_51,negated_conjecture,
( ~ segmentP(esk51_0,app(app(X1,X2),X3))
| ~ segmentP(X2,esk48_0)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_40])]) ).
cnf(c_0_52,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_53,plain,
! [X135] :
( ~ ssList(X135)
| app(nil,X135) = X135 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_54,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( cons(hd(esk51_0),X1) = app(esk48_0,X1)
| esk51_0 = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_30]),c_0_26])]) ).
fof(c_0_56,plain,
! [X127] :
( ~ ssList(X127)
| nil = X127
| ssList(tl(X127)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])]) ).
cnf(c_0_57,negated_conjecture,
( ~ segmentP(esk51_0,app(app(X1,esk48_0),X2))
| ~ ssList(app(app(X1,esk48_0),X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_40])]) ).
cnf(c_0_58,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( app(esk48_0,tl(esk51_0)) = esk51_0
| esk51_0 = nil
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_26])]) ).
cnf(c_0_60,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( ~ segmentP(esk51_0,app(esk48_0,X1))
| ~ ssList(app(esk48_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_27]),c_0_40])]) ).
cnf(c_0_62,negated_conjecture,
( app(esk48_0,tl(esk51_0)) = esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_26])]) ).
cnf(c_0_63,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk51_0,esk51_0)
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_26])]) ).
cnf(c_0_64,negated_conjecture,
( esk51_0 = nil
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_52]),c_0_26])]) ).
cnf(c_0_65,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_66,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_60]),c_0_26])]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_68,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_20,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC354+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n019.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:54:23 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.68/0.56 # Version: 3.1.0
% 0.68/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.68/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.68/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.56 # Starting sh5l with 300s (1) cores
% 0.68/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30169 completed with status 0
% 0.68/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.68/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.68/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.68/0.56 # No SInE strategy applied
% 0.68/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.68/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.68/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.68/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.68/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.68/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.68/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 30180 completed with status 0
% 0.68/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.68/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.68/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.68/0.56 # No SInE strategy applied
% 0.68/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.68/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.68/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.68/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.68/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.68/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.68/0.56 # Preprocessing time : 0.003 s
% 0.68/0.56 # Presaturation interreduction done
% 0.68/0.56
% 0.68/0.56 # Proof found!
% 0.68/0.56 # SZS status Theorem
% 0.68/0.56 # SZS output start CNFRefutation
% See solution above
% 0.68/0.56 # Parsed axioms : 96
% 0.68/0.56 # Removed by relevancy pruning/SinE : 0
% 0.68/0.56 # Initial clauses : 202
% 0.68/0.56 # Removed in clause preprocessing : 2
% 0.68/0.56 # Initial clauses in saturation : 200
% 0.68/0.56 # Processed clauses : 639
% 0.68/0.56 # ...of these trivial : 5
% 0.68/0.56 # ...subsumed : 121
% 0.68/0.56 # ...remaining for further processing : 513
% 0.68/0.56 # Other redundant clauses eliminated : 62
% 0.68/0.56 # Clauses deleted for lack of memory : 0
% 0.68/0.56 # Backward-subsumed : 35
% 0.68/0.56 # Backward-rewritten : 62
% 0.68/0.56 # Generated clauses : 986
% 0.68/0.56 # ...of the previous two non-redundant : 873
% 0.68/0.56 # ...aggressively subsumed : 0
% 0.68/0.56 # Contextual simplify-reflections : 7
% 0.68/0.56 # Paramodulations : 922
% 0.68/0.56 # Factorizations : 0
% 0.68/0.56 # NegExts : 0
% 0.68/0.56 # Equation resolutions : 67
% 0.68/0.56 # Disequality decompositions : 0
% 0.68/0.56 # Total rewrite steps : 549
% 0.68/0.56 # ...of those cached : 536
% 0.68/0.56 # Propositional unsat checks : 0
% 0.68/0.56 # Propositional check models : 0
% 0.68/0.56 # Propositional check unsatisfiable : 0
% 0.68/0.56 # Propositional clauses : 0
% 0.68/0.56 # Propositional clauses after purity: 0
% 0.68/0.56 # Propositional unsat core size : 0
% 0.68/0.56 # Propositional preprocessing time : 0.000
% 0.68/0.56 # Propositional encoding time : 0.000
% 0.68/0.56 # Propositional solver time : 0.000
% 0.68/0.56 # Success case prop preproc time : 0.000
% 0.68/0.56 # Success case prop encoding time : 0.000
% 0.68/0.56 # Success case prop solver time : 0.000
% 0.68/0.56 # Current number of processed clauses : 201
% 0.68/0.56 # Positive orientable unit clauses : 21
% 0.68/0.56 # Positive unorientable unit clauses: 0
% 0.68/0.56 # Negative unit clauses : 3
% 0.68/0.56 # Non-unit-clauses : 177
% 0.68/0.56 # Current number of unprocessed clauses: 598
% 0.68/0.56 # ...number of literals in the above : 3847
% 0.68/0.56 # Current number of archived formulas : 0
% 0.68/0.56 # Current number of archived clauses : 288
% 0.68/0.56 # Clause-clause subsumption calls (NU) : 20945
% 0.68/0.56 # Rec. Clause-clause subsumption calls : 5396
% 0.68/0.56 # Non-unit clause-clause subsumptions : 149
% 0.68/0.56 # Unit Clause-clause subsumption calls : 77
% 0.68/0.56 # Rewrite failures with RHS unbound : 0
% 0.68/0.56 # BW rewrite match attempts : 3
% 0.68/0.56 # BW rewrite match successes : 3
% 0.68/0.56 # Condensation attempts : 0
% 0.68/0.56 # Condensation successes : 0
% 0.68/0.56 # Termbank termtop insertions : 34998
% 0.68/0.56 # Search garbage collected termcells : 4312
% 0.68/0.56
% 0.68/0.56 # -------------------------------------------------
% 0.68/0.56 # User time : 0.061 s
% 0.68/0.56 # System time : 0.006 s
% 0.68/0.56 # Total time : 0.067 s
% 0.68/0.56 # Maximum resident set size: 2468 pages
% 0.68/0.56
% 0.68/0.56 # -------------------------------------------------
% 0.68/0.56 # User time : 0.272 s
% 0.68/0.56 # System time : 0.017 s
% 0.68/0.56 # Total time : 0.289 s
% 0.68/0.56 # Maximum resident set size: 1824 pages
% 0.68/0.56 % E---3.1 exiting
% 0.68/0.56 % E exiting
%------------------------------------------------------------------------------