TSTP Solution File: SWC081+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC081+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:39:14 EDT 2023
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 67 ( 15 unt; 0 def)
% Number of atoms : 257 ( 60 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 310 ( 120 ~; 127 |; 34 &)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn; 42 !; 5 ?)
% 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)
=> ( ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',co1) ).
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/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax17) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax5) ).
fof(ax41,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax41) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax45) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax15) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax55) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.yZL81TU1sV/E---3.1_780.p',ax58) ).
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)
=> ( ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,plain,
! [X41,X42,X45,X46] :
( ( ssList(esk9_2(X41,X42))
| ~ segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( ssList(esk10_2(X41,X42))
| ~ segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( app(app(esk9_2(X41,X42),X42),esk10_2(X41,X42)) = X41
| ~ segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( ~ ssList(X45)
| ~ ssList(X46)
| app(app(X45,X42),X46) != X41
| segmentP(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) ) ),
inference(distribute,[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_13,negated_conjecture,
! [X11] :
( 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(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( nil = esk4_0
| ssList(esk5_0) )
& ( nil = esk3_0
| ssList(esk5_0) )
& ( nil = esk4_0
| neq(esk5_0,nil) )
& ( nil = esk3_0
| neq(esk5_0,nil) )
& ( nil = esk4_0
| frontsegP(esk4_0,esk5_0) )
& ( nil = esk3_0
| frontsegP(esk4_0,esk5_0) )
& ( nil = esk4_0
| frontsegP(esk3_0,esk5_0) )
& ( nil = esk3_0
| frontsegP(esk3_0,esk5_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
cnf(c_0_14,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_12]) ).
fof(c_0_15,plain,
! [X76] :
( ~ ssList(X76)
| app(nil,X76) = X76 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_16,plain,
! [X74,X75] :
( ~ ssList(X74)
| ~ ssList(X75)
| ssList(app(X74,X75)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_17,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_18,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,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_14]) ).
cnf(c_0_21,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X18,X19,X21] :
( ( ssList(esk8_2(X18,X19))
| ~ frontsegP(X18,X19)
| ~ ssList(X19)
| ~ ssList(X18) )
& ( app(X19,esk8_2(X18,X19)) = X18
| ~ frontsegP(X18,X19)
| ~ ssList(X19)
| ~ ssList(X18) )
& ( ~ ssList(X21)
| app(X19,X21) != X18
| frontsegP(X18,X19)
| ~ ssList(X19)
| ~ ssList(X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).
cnf(c_0_25,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( nil = esk3_0
| neq(esk5_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk3_0
| ssList(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,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_20,c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_29,plain,
( app(X1,esk8_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ssList(esk8_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_32,plain,
! [X25,X26] :
( ~ ssList(X25)
| ~ ssList(X26)
| ~ frontsegP(X25,X26)
| ~ frontsegP(X26,X25)
| X25 = X26 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax41])])]) ).
cnf(c_0_33,negated_conjecture,
( esk3_0 = nil
| ~ segmentP(esk3_0,esk5_0)
| ~ segmentP(esk4_0,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_34,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_36,negated_conjecture,
( nil = esk3_0
| frontsegP(esk3_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( nil = esk4_0
| frontsegP(esk3_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,negated_conjecture,
( nil = esk4_0
| ssList(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( esk3_0 = nil
| ~ segmentP(esk4_0,esk5_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_27]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_37,c_0_19]) ).
cnf(c_0_43,negated_conjecture,
( nil = esk3_0
| frontsegP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_44,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,negated_conjecture,
( esk4_0 = nil
| esk5_0 = esk3_0
| ~ frontsegP(esk5_0,esk3_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_35])]),c_0_40]) ).
cnf(c_0_46,negated_conjecture,
esk3_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_34]),c_0_42])]),c_0_27]),c_0_43]) ).
fof(c_0_47,plain,
! [X35] :
( ~ ssList(X35)
| frontsegP(X35,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_48,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_44,c_0_19]) ).
fof(c_0_49,plain,
! [X39,X40] :
( ( ~ neq(X39,X40)
| X39 != X40
| ~ ssList(X40)
| ~ ssList(X39) )
& ( X39 = X40
| neq(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_50,negated_conjecture,
( esk5_0 = nil
| esk4_0 = nil
| ~ frontsegP(esk5_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_51,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( ~ segmentP(esk3_0,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_48]),c_0_42])]) ).
fof(c_0_53,plain,
! [X52] :
( ~ ssList(X52)
| segmentP(X52,X52) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_54,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( nil = esk4_0
| neq(esk5_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_56,negated_conjecture,
( esk4_0 = nil
| esk5_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_40]) ).
fof(c_0_57,plain,
! [X58] :
( ( ~ segmentP(nil,X58)
| nil = X58
| ~ ssList(X58) )
& ( nil != X58
| segmentP(nil,X58)
| ~ ssList(X58) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_58,negated_conjecture,
( ~ segmentP(nil,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(rw,[status(thm)],[c_0_52,c_0_46]) ).
cnf(c_0_59,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( esk4_0 = nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_63,negated_conjecture,
~ segmentP(nil,esk4_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_64,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_22])]) ).
cnf(c_0_65,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_62]),c_0_22])]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC081+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31 % CPULimit : 2400
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Tue Oct 3 01:44:01 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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/tmp/tmp.yZL81TU1sV/E---3.1_780.p
% 0.15/0.47 # Version: 3.1pre001
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # new_bool_3 with pid 863 completed with status 0
% 0.15/0.47 # Result found by new_bool_3
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 867 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.47 # Preprocessing time : 0.002 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Theorem
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 96
% 0.15/0.47 # Removed by relevancy pruning/SinE : 62
% 0.15/0.47 # Initial clauses : 67
% 0.15/0.47 # Removed in clause preprocessing : 0
% 0.15/0.47 # Initial clauses in saturation : 67
% 0.15/0.47 # Processed clauses : 393
% 0.15/0.47 # ...of these trivial : 2
% 0.15/0.47 # ...subsumed : 77
% 0.15/0.47 # ...remaining for further processing : 314
% 0.15/0.47 # Other redundant clauses eliminated : 26
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 31
% 0.15/0.47 # Backward-rewritten : 121
% 0.15/0.47 # Generated clauses : 818
% 0.15/0.47 # ...of the previous two non-redundant : 758
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 72
% 0.15/0.47 # Paramodulations : 789
% 0.15/0.47 # Factorizations : 0
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 30
% 0.15/0.47 # Total rewrite steps : 363
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 89
% 0.15/0.47 # Positive orientable unit clauses : 12
% 0.15/0.47 # Positive unorientable unit clauses: 0
% 0.15/0.47 # Negative unit clauses : 1
% 0.15/0.47 # Non-unit-clauses : 76
% 0.15/0.47 # Current number of unprocessed clauses: 495
% 0.15/0.47 # ...number of literals in the above : 2709
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 217
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 5139
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 1534
% 0.15/0.47 # Non-unit clause-clause subsumptions : 175
% 0.15/0.47 # Unit Clause-clause subsumption calls : 52
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 3
% 0.15/0.47 # BW rewrite match successes : 3
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 17912
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.032 s
% 0.15/0.47 # System time : 0.001 s
% 0.15/0.47 # Total time : 0.034 s
% 0.15/0.47 # Maximum resident set size: 2032 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.036 s
% 0.15/0.47 # System time : 0.002 s
% 0.15/0.47 # Total time : 0.038 s
% 0.15/0.47 # Maximum resident set size: 1800 pages
% 0.15/0.47 % E---3.1 exiting
% 0.15/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------