TSTP Solution File: SWC168+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC168+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:24:02 EDT 2024
% Result : Theorem 0.16s 0.52s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 19 unt; 0 def)
% Number of atoms : 253 ( 55 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 313 ( 109 ~; 109 |; 52 &)
% ( 3 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 70 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1
| neq(X15,X16) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(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
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1
| neq(X15,X16) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_11,negated_conjecture,
! [X25,X26,X27,X28,X29,X30,X31,X32] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X25)
| ~ ssList(X26)
| app(X26,cons(X25,nil)) != esk5_0
| ~ ssItem(X27)
| ~ ssList(X28)
| app(cons(X27,nil),X28) != esk3_0
| ~ lt(X25,X27) )
& ( ~ ssItem(X29)
| ~ ssList(X30)
| app(cons(X29,nil),X30) != esk6_0
| ~ ssItem(X31)
| ~ ssList(X32)
| app(X32,cons(X31,nil)) != esk3_0
| ~ lt(X31,X29) )
& ssItem(esk7_0)
& ssItem(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk8_0,nil)),esk10_0) = esk1_0
& ~ neq(esk7_0,esk8_0)
& ( nil = esk4_0
| nil != 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_9])])])])]) ).
fof(c_0_12,plain,
! [X48,X49] :
( ( ~ neq(X48,X49)
| X48 != X49
| ~ ssItem(X49)
| ~ ssItem(X48) )
& ( X48 = X49
| neq(X48,X49)
| ~ ssItem(X49)
| ~ ssItem(X48) ) ),
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_10])])])])]) ).
cnf(c_0_13,negated_conjecture,
app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk8_0,nil)),esk10_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ neq(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
ssItem(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk8_0,nil)),esk10_0) = esk3_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
esk8_0 = esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
fof(c_0_21,plain,
! [X87,X88,X89] :
( ~ ssList(X87)
| ~ ssList(X88)
| ~ ssList(X89)
| app(app(X87,X88),X89) = app(X87,app(X88,X89)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_22,negated_conjecture,
app(app(app(esk9_0,cons(esk7_0,nil)),cons(esk7_0,nil)),esk10_0) = esk3_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X94,X95] :
( ~ ssList(X94)
| ~ ssItem(X95)
| ssList(cons(X95,X94)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_26,negated_conjecture,
( app(app(esk9_0,cons(esk7_0,nil)),app(cons(esk7_0,nil),esk10_0)) = esk3_0
| ~ ssList(app(esk9_0,cons(esk7_0,nil)))
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_29,plain,
! [X66,X67] :
( ~ ssList(X66)
| ~ ssList(X67)
| ssList(app(X66,X67)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_30,negated_conjecture,
( app(app(esk9_0,cons(esk7_0,nil)),app(cons(esk7_0,nil),esk10_0)) = esk3_0
| ~ ssList(app(esk9_0,cons(esk7_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_18])]) ).
cnf(c_0_31,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X140,X141,X142,X143,X144,X145] :
( ( ~ strictorderedP(X140)
| ~ ssItem(X141)
| ~ ssItem(X142)
| ~ ssList(X143)
| ~ ssList(X144)
| ~ ssList(X145)
| app(app(X143,cons(X141,X144)),cons(X142,X145)) != X140
| lt(X141,X142)
| ~ ssList(X140) )
& ( ssItem(esk24_1(X140))
| strictorderedP(X140)
| ~ ssList(X140) )
& ( ssItem(esk25_1(X140))
| strictorderedP(X140)
| ~ ssList(X140) )
& ( ssList(esk26_1(X140))
| strictorderedP(X140)
| ~ ssList(X140) )
& ( ssList(esk27_1(X140))
| strictorderedP(X140)
| ~ ssList(X140) )
& ( ssList(esk28_1(X140))
| strictorderedP(X140)
| ~ ssList(X140) )
& ( app(app(esk26_1(X140),cons(esk24_1(X140),esk27_1(X140))),cons(esk25_1(X140),esk28_1(X140))) = X140
| strictorderedP(X140)
| ~ ssList(X140) )
& ( ~ lt(esk24_1(X140),esk25_1(X140))
| strictorderedP(X140)
| ~ ssList(X140) ) ),
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)],[ax12])])])])])]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk9_0,cons(esk7_0,nil)),app(cons(esk7_0,nil),esk10_0)) = esk3_0
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
fof(c_0_35,plain,
! [X43,X44] :
( ~ ssList(X43)
| ~ ssItem(X44)
| cons(X44,X43) = app(cons(X44,nil),X43) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_36,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
cnf(c_0_37,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
app(app(esk9_0,cons(esk7_0,nil)),app(cons(esk7_0,nil),esk10_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_28]),c_0_18])]) ).
cnf(c_0_39,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_41,plain,
! [X116,X117] :
( ~ ssItem(X116)
| ~ ssItem(X117)
| ~ lt(X116,X117)
| ~ lt(X117,X116) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).
cnf(c_0_42,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
app(app(esk9_0,cons(esk7_0,nil)),cons(esk7_0,esk10_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24]),c_0_18])]) ).
cnf(c_0_44,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_40,c_0_14]) ).
cnf(c_0_46,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
lt(esk7_0,esk7_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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_24]),c_0_28]),c_0_32]),c_0_18])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_47]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC168+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n014.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.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 03:26:53 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.52 # Version: 3.1.0
% 0.16/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.52 # Starting sh5l with 300s (1) cores
% 0.16/0.52 # sh5l with pid 9108 completed with status 0
% 0.16/0.52 # Result found by sh5l
% 0.16/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.52 # Starting sh5l with 300s (1) cores
% 0.16/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.52 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.16/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.16/0.52 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 9111 completed with status 0
% 0.16/0.52 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.16/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.52 # Starting sh5l with 300s (1) cores
% 0.16/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.52 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.16/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.16/0.52 # Preprocessing time : 0.003 s
% 0.16/0.52 # Presaturation interreduction done
% 0.16/0.52
% 0.16/0.52 # Proof found!
% 0.16/0.52 # SZS status Theorem
% 0.16/0.52 # SZS output start CNFRefutation
% See solution above
% 0.16/0.52 # Parsed axioms : 96
% 0.16/0.52 # Removed by relevancy pruning/SinE : 12
% 0.16/0.52 # Initial clauses : 175
% 0.16/0.52 # Removed in clause preprocessing : 2
% 0.16/0.52 # Initial clauses in saturation : 173
% 0.16/0.52 # Processed clauses : 780
% 0.16/0.52 # ...of these trivial : 3
% 0.16/0.52 # ...subsumed : 132
% 0.16/0.52 # ...remaining for further processing : 645
% 0.16/0.52 # Other redundant clauses eliminated : 55
% 0.16/0.52 # Clauses deleted for lack of memory : 0
% 0.16/0.52 # Backward-subsumed : 89
% 0.16/0.52 # Backward-rewritten : 40
% 0.16/0.52 # Generated clauses : 1531
% 0.16/0.52 # ...of the previous two non-redundant : 1333
% 0.16/0.52 # ...aggressively subsumed : 0
% 0.16/0.52 # Contextual simplify-reflections : 45
% 0.16/0.52 # Paramodulations : 1472
% 0.16/0.52 # Factorizations : 0
% 0.16/0.52 # NegExts : 0
% 0.16/0.52 # Equation resolutions : 60
% 0.16/0.52 # Disequality decompositions : 0
% 0.16/0.52 # Total rewrite steps : 1300
% 0.16/0.52 # ...of those cached : 1247
% 0.16/0.52 # Propositional unsat checks : 0
% 0.16/0.52 # Propositional check models : 0
% 0.16/0.52 # Propositional check unsatisfiable : 0
% 0.16/0.52 # Propositional clauses : 0
% 0.16/0.52 # Propositional clauses after purity: 0
% 0.16/0.52 # Propositional unsat core size : 0
% 0.16/0.52 # Propositional preprocessing time : 0.000
% 0.16/0.52 # Propositional encoding time : 0.000
% 0.16/0.52 # Propositional solver time : 0.000
% 0.16/0.52 # Success case prop preproc time : 0.000
% 0.16/0.52 # Success case prop encoding time : 0.000
% 0.16/0.52 # Success case prop solver time : 0.000
% 0.16/0.52 # Current number of processed clauses : 331
% 0.16/0.52 # Positive orientable unit clauses : 61
% 0.16/0.52 # Positive unorientable unit clauses: 0
% 0.16/0.52 # Negative unit clauses : 3
% 0.16/0.52 # Non-unit-clauses : 267
% 0.16/0.52 # Current number of unprocessed clauses: 861
% 0.16/0.52 # ...number of literals in the above : 4869
% 0.16/0.52 # Current number of archived formulas : 0
% 0.16/0.52 # Current number of archived clauses : 296
% 0.16/0.52 # Clause-clause subsumption calls (NU) : 25452
% 0.16/0.52 # Rec. Clause-clause subsumption calls : 11051
% 0.16/0.52 # Non-unit clause-clause subsumptions : 265
% 0.16/0.52 # Unit Clause-clause subsumption calls : 604
% 0.16/0.52 # Rewrite failures with RHS unbound : 0
% 0.16/0.52 # BW rewrite match attempts : 23
% 0.16/0.52 # BW rewrite match successes : 20
% 0.16/0.52 # Condensation attempts : 0
% 0.16/0.52 # Condensation successes : 0
% 0.16/0.52 # Termbank termtop insertions : 45941
% 0.16/0.52 # Search garbage collected termcells : 3885
% 0.16/0.52
% 0.16/0.52 # -------------------------------------------------
% 0.16/0.52 # User time : 0.074 s
% 0.16/0.52 # System time : 0.004 s
% 0.16/0.52 # Total time : 0.078 s
% 0.16/0.52 # Maximum resident set size: 2432 pages
% 0.16/0.52
% 0.16/0.52 # -------------------------------------------------
% 0.16/0.52 # User time : 0.077 s
% 0.16/0.52 # System time : 0.006 s
% 0.16/0.52 # Total time : 0.083 s
% 0.16/0.52 # Maximum resident set size: 1852 pages
% 0.16/0.52 % E---3.1 exiting
% 0.16/0.52 % E exiting
%------------------------------------------------------------------------------