TSTP Solution File: SWC177+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC177+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:53 EDT 2023
% Result : Theorem 0.93s 0.58s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 259 ( 81 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 327 ( 129 ~; 130 |; 30 &)
% ( 3 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn; 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != 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) ) )
| ( ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X3
| ~ memberP(X4,X9) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax16) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',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/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax82) ).
fof(ax71,axiom,
! [X1] :
( ssItem(X1)
=> duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax71) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax18) ).
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/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax13) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sZLnPAdTuf/E---3.1_30357.p',ax81) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != 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) ) )
| ( ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X3
| ~ memberP(X4,X9) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_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)
& ( nil = esk51_0
| ssItem(esk56_0) )
& ( nil = esk50_0
| ssItem(esk56_0) )
& ( nil = esk51_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk56_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk56_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_13,plain,
! [X228,X229] :
( ( nil = X229
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil = X228
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil != X229
| nil != X228
| nil = app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
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_12]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
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,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X133,X134] :
( ~ ssList(X133)
| ~ ssList(X134)
| ssList(app(X133,X134)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_20,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X114,X115] :
( ~ ssList(X114)
| ~ ssItem(X115)
| ssList(cons(X115,X114)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_27,plain,
! [X10,X11] :
( ( ~ neq(X10,X11)
| X10 != X11
| ~ ssItem(X11)
| ~ ssItem(X10) )
& ( X10 = X11
| neq(X10,X11)
| ~ ssItem(X11)
| ~ ssItem(X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
cnf(c_0_28,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_25])]) ).
cnf(c_0_29,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_32,plain,
! [X225,X226,X227] :
( ~ ssList(X225)
| ~ ssList(X226)
| ~ ssList(X227)
| app(app(X225,X226),X227) = app(X225,app(X226,X227)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_33,negated_conjecture,
~ neq(esk52_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_36,plain,
! [X208] :
( ~ ssItem(X208)
| duplicatefreeP(cons(X208,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax71])]) ).
fof(c_0_37,plain,
! [X116,X117] :
( ~ ssList(X116)
| ~ ssItem(X117)
| cons(X117,X116) != X116 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_38,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
fof(c_0_39,plain,
! [X92,X93,X94,X95,X96,X97] :
( ( ~ duplicatefreeP(X92)
| ~ ssItem(X93)
| ~ ssItem(X94)
| ~ ssList(X95)
| ~ ssList(X96)
| ~ ssList(X97)
| app(app(X95,cons(X93,X96)),cons(X94,X97)) != X92
| X93 != X94
| ~ ssList(X92) )
& ( ssItem(esk35_1(X92))
| duplicatefreeP(X92)
| ~ ssList(X92) )
& ( ssItem(esk36_1(X92))
| duplicatefreeP(X92)
| ~ ssList(X92) )
& ( ssList(esk37_1(X92))
| duplicatefreeP(X92)
| ~ ssList(X92) )
& ( ssList(esk38_1(X92))
| duplicatefreeP(X92)
| ~ ssList(X92) )
& ( ssList(esk39_1(X92))
| duplicatefreeP(X92)
| ~ ssList(X92) )
& ( app(app(esk37_1(X92),cons(esk35_1(X92),esk38_1(X92))),cons(esk36_1(X92),esk39_1(X92))) = X92
| duplicatefreeP(X92)
| ~ ssList(X92) )
& ( esk35_1(X92) = esk36_1(X92)
| duplicatefreeP(X92)
| ~ ssList(X92) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax13])])])])]) ).
cnf(c_0_40,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31]),c_0_35])]) ).
fof(c_0_42,plain,
! [X223,X224] :
( ~ ssList(X223)
| ~ ssItem(X224)
| cons(X224,X223) = app(cons(X224,nil),X223) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_43,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
( nil = esk50_0
| ssItem(esk56_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_30]),c_0_35])]) ).
cnf(c_0_48,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_39]) ).
cnf(c_0_49,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_17,c_0_40]),c_0_41]),c_0_18]),c_0_41])]) ).
cnf(c_0_50,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( esk50_0 = nil
| duplicatefreeP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_30]),c_0_31])]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_54,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_48])]) ).
cnf(c_0_55,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,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(spm,[status(thm)],[c_0_49,c_0_50]),c_0_18]),c_0_35])]) ).
cnf(c_0_56,negated_conjecture,
duplicatefreeP(esk50_0),
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_53,c_0_15]) ).
cnf(c_0_58,negated_conjecture,
( ~ 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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]),c_0_18]),c_0_30]),c_0_25]),c_0_35])]) ).
cnf(c_0_59,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_21]),c_0_25])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_29]),c_0_30]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC177+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Oct 3 02:04:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.48 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.sZLnPAdTuf/E---3.1_30357.p
% 0.93/0.58 # Version: 3.1pre001
% 0.93/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.58 # Starting sh5l with 300s (1) cores
% 0.93/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30434 completed with status 0
% 0.93/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.93/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.58 # No SInE strategy applied
% 0.93/0.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.93/0.58 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.93/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.93/0.58 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.93/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 30443 completed with status 0
% 0.93/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.93/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.58 # No SInE strategy applied
% 0.93/0.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.93/0.58 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.93/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.93/0.58 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.93/0.58 # Preprocessing time : 0.004 s
% 0.93/0.58 # Presaturation interreduction done
% 0.93/0.58
% 0.93/0.58 # Proof found!
% 0.93/0.58 # SZS status Theorem
% 0.93/0.58 # SZS output start CNFRefutation
% See solution above
% 0.93/0.58 # Parsed axioms : 96
% 0.93/0.58 # Removed by relevancy pruning/SinE : 0
% 0.93/0.58 # Initial clauses : 208
% 0.93/0.58 # Removed in clause preprocessing : 2
% 0.93/0.58 # Initial clauses in saturation : 206
% 0.93/0.58 # Processed clauses : 632
% 0.93/0.58 # ...of these trivial : 11
% 0.93/0.58 # ...subsumed : 83
% 0.93/0.58 # ...remaining for further processing : 538
% 0.93/0.58 # Other redundant clauses eliminated : 76
% 0.93/0.58 # Clauses deleted for lack of memory : 0
% 0.93/0.58 # Backward-subsumed : 42
% 0.93/0.58 # Backward-rewritten : 6
% 0.93/0.58 # Generated clauses : 1452
% 0.93/0.58 # ...of the previous two non-redundant : 1235
% 0.93/0.58 # ...aggressively subsumed : 0
% 0.93/0.58 # Contextual simplify-reflections : 31
% 0.93/0.58 # Paramodulations : 1363
% 0.93/0.58 # Factorizations : 0
% 0.93/0.58 # NegExts : 0
% 0.93/0.58 # Equation resolutions : 81
% 0.93/0.58 # Total rewrite steps : 1021
% 0.93/0.58 # Propositional unsat checks : 0
% 0.93/0.58 # Propositional check models : 0
% 0.93/0.58 # Propositional check unsatisfiable : 0
% 0.93/0.58 # Propositional clauses : 0
% 0.93/0.58 # Propositional clauses after purity: 0
% 0.93/0.58 # Propositional unsat core size : 0
% 0.93/0.58 # Propositional preprocessing time : 0.000
% 0.93/0.58 # Propositional encoding time : 0.000
% 0.93/0.58 # Propositional solver time : 0.000
% 0.93/0.58 # Success case prop preproc time : 0.000
% 0.93/0.58 # Success case prop encoding time : 0.000
% 0.93/0.58 # Success case prop solver time : 0.000
% 0.93/0.58 # Current number of processed clauses : 257
% 0.93/0.58 # Positive orientable unit clauses : 45
% 0.93/0.58 # Positive unorientable unit clauses: 0
% 0.93/0.58 # Negative unit clauses : 7
% 0.93/0.58 # Non-unit-clauses : 205
% 0.93/0.58 # Current number of unprocessed clauses: 997
% 0.93/0.58 # ...number of literals in the above : 6467
% 0.93/0.58 # Current number of archived formulas : 0
% 0.93/0.58 # Current number of archived clauses : 258
% 0.93/0.58 # Clause-clause subsumption calls (NU) : 20324
% 0.93/0.58 # Rec. Clause-clause subsumption calls : 5444
% 0.93/0.58 # Non-unit clause-clause subsumptions : 91
% 0.93/0.58 # Unit Clause-clause subsumption calls : 174
% 0.93/0.58 # Rewrite failures with RHS unbound : 0
% 0.93/0.58 # BW rewrite match attempts : 16
% 0.93/0.58 # BW rewrite match successes : 15
% 0.93/0.58 # Condensation attempts : 0
% 0.93/0.58 # Condensation successes : 0
% 0.93/0.58 # Termbank termtop insertions : 45657
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.082 s
% 0.93/0.58 # System time : 0.009 s
% 0.93/0.58 # Total time : 0.091 s
% 0.93/0.58 # Maximum resident set size: 2492 pages
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.364 s
% 0.93/0.58 # System time : 0.029 s
% 0.93/0.58 # Total time : 0.393 s
% 0.93/0.58 # Maximum resident set size: 1804 pages
% 0.93/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------