TSTP Solution File: SWC418+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC418+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:29:37 EDT 2024
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 67 ( 13 unt; 0 def)
% Number of atoms : 278 ( 105 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 348 ( 137 ~; 135 |; 42 &)
% ( 2 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 46 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ( nil != X3
& nil = X4 )
| ( ? [X8] :
( ssList(X8)
& X3 != X8
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& tl(X4) = X9
& app(X9,X10) = X8
& ? [X11] :
( ssItem(X11)
& cons(X11,nil) = X10
& hd(X4) = X11
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(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(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
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] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ( nil != X3
& nil = X4 )
| ( ? [X8] :
( ssList(X8)
& X3 != X8
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& tl(X4) = X9
& app(X9,X10) = X8
& ? [X11] :
( ssItem(X11)
& cons(X11,nil) = X10
& hd(X4) = X11
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,negated_conjecture,
! [X260,X261,X262,X263,X264,X265,X266] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ( ~ ssItem(X260)
| ~ ssList(X261)
| ~ ssList(X262)
| app(app(X261,cons(X260,nil)),X262) != esk49_0
| app(app(X262,cons(X260,nil)),X261) != esk48_0 )
& ( nil = esk50_0
| nil != esk51_0 )
& ( ~ ssList(X263)
| esk50_0 = X263
| ~ ssList(X264)
| ~ ssList(X265)
| tl(esk51_0) != X264
| app(X264,X265) != X263
| ~ ssItem(X266)
| cons(X266,nil) != X265
| hd(esk51_0) != X266
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ) ),
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])])])])]) ).
cnf(c_0_13,negated_conjecture,
( esk50_0 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(esk51_0) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(esk51_0) != X4
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_14,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X135,X136] :
( ~ ssList(X135)
| ~ ssList(X136)
| ssList(app(X135,X136)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
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
| hd(esk51_0) != X4
| tl(esk51_0) != X2
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssItem(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
inference(cn,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X114,X115] :
( ( ~ neq(X114,X115)
| X114 != X115
| ~ ssList(X115)
| ~ ssList(X114) )
& ( X114 = X115
| neq(X114,X115)
| ~ ssList(X115)
| ~ ssList(X114) ) ),
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_12]) ).
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,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk50_0
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[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_15]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,plain,
! [X129] :
( ~ ssList(X129)
| nil = X129
| ssItem(hd(X129)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
fof(c_0_29,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_30,negated_conjecture,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk50_0
| esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0))
| ~ 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_31,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,plain,
! [X132] :
( ~ ssList(X132)
| nil = X132
| ssList(tl(X132)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_33,negated_conjecture,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk50_0
| esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26])]) ).
cnf(c_0_34,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_35,plain,
! [X116,X117] :
( ~ ssList(X116)
| ~ ssItem(X117)
| ssList(cons(X117,X116)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_36,negated_conjecture,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk50_0
| esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26])]) ).
cnf(c_0_37,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| app(app(X3,cons(X1,nil)),X2) != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,negated_conjecture,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk50_0
| esk51_0 = nil
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_27])]) ).
cnf(c_0_41,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk50_0
| app(app(X3,cons(X2,nil)),X1) != esk51_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_15]) ).
cnf(c_0_42,negated_conjecture,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_26])]) ).
fof(c_0_43,plain,
! [X232] :
( ~ ssList(X232)
| app(X232,nil) = X232 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
( esk51_0 = nil
| app(app(X1,cons(hd(esk51_0),nil)),tl(esk51_0)) != esk51_0
| app(esk50_0,X1) != esk50_0
| ~ ssList(tl(esk51_0))
| ~ ssList(X1)
| ~ ssItem(hd(esk51_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_44,c_0_39]) ).
fof(c_0_48,plain,
! [X140] :
( ~ ssList(X140)
| app(nil,X140) = X140 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_49,negated_conjecture,
( esk51_0 = nil
| app(app(nil,cons(hd(esk51_0),nil)),tl(esk51_0)) != esk51_0
| ~ ssList(tl(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_27]),c_0_47])]) ).
cnf(c_0_50,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
fof(c_0_51,plain,
! [X225,X226] :
( ~ ssList(X225)
| ~ ssItem(X226)
| cons(X226,X225) = app(cons(X226,nil),X225) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_52,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_53,negated_conjecture,
( esk51_0 = nil
| app(cons(hd(esk51_0),nil),tl(esk51_0)) != esk51_0
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_55,plain,
! [X218] :
( ~ ssList(X218)
| nil = X218
| cons(hd(X218),tl(X218)) = X218 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])])]) ).
cnf(c_0_56,negated_conjecture,
( esk51_0 = nil
| cons(hd(esk51_0),tl(esk51_0)) != esk51_0
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_26])]) ).
cnf(c_0_59,negated_conjecture,
( esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_26])]) ).
cnf(c_0_60,negated_conjecture,
( esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_34]),c_0_26])]) ).
cnf(c_0_61,negated_conjecture,
( esk51_0 = nil
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_37]),c_0_27])]) ).
cnf(c_0_62,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_63,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_31]),c_0_26])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_65,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_19,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC418+1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n013.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:53:38 EDT 2024
% 0.19/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.56 # Version: 3.1.0
% 0.20/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.56 # Starting sh5l with 300s (1) cores
% 0.20/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30310 completed with status 0
% 0.20/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.56 # No SInE strategy applied
% 0.20/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.20/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.20/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 30321 completed with status 0
% 0.20/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.20/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.56 # No SInE strategy applied
% 0.20/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.20/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.20/0.56 # Preprocessing time : 0.004 s
% 0.20/0.56 # Presaturation interreduction done
% 0.20/0.56
% 0.20/0.56 # Proof found!
% 0.20/0.56 # SZS status Theorem
% 0.20/0.56 # SZS output start CNFRefutation
% See solution above
% 0.20/0.56 # Parsed axioms : 96
% 0.20/0.56 # Removed by relevancy pruning/SinE : 0
% 0.20/0.56 # Initial clauses : 200
% 0.20/0.56 # Removed in clause preprocessing : 2
% 0.20/0.56 # Initial clauses in saturation : 198
% 0.20/0.56 # Processed clauses : 498
% 0.20/0.56 # ...of these trivial : 3
% 0.20/0.56 # ...subsumed : 37
% 0.20/0.56 # ...remaining for further processing : 458
% 0.20/0.56 # Other redundant clauses eliminated : 61
% 0.20/0.56 # Clauses deleted for lack of memory : 0
% 0.20/0.56 # Backward-subsumed : 53
% 0.20/0.56 # Backward-rewritten : 18
% 0.20/0.56 # Generated clauses : 599
% 0.20/0.56 # ...of the previous two non-redundant : 512
% 0.20/0.56 # ...aggressively subsumed : 0
% 0.20/0.56 # Contextual simplify-reflections : 9
% 0.20/0.56 # Paramodulations : 538
% 0.20/0.56 # Factorizations : 0
% 0.20/0.56 # NegExts : 0
% 0.20/0.56 # Equation resolutions : 66
% 0.20/0.56 # Disequality decompositions : 0
% 0.20/0.56 # Total rewrite steps : 246
% 0.20/0.56 # ...of those cached : 236
% 0.20/0.56 # Propositional unsat checks : 0
% 0.20/0.56 # Propositional check models : 0
% 0.20/0.56 # Propositional check unsatisfiable : 0
% 0.20/0.56 # Propositional clauses : 0
% 0.20/0.56 # Propositional clauses after purity: 0
% 0.20/0.56 # Propositional unsat core size : 0
% 0.20/0.56 # Propositional preprocessing time : 0.000
% 0.20/0.56 # Propositional encoding time : 0.000
% 0.20/0.56 # Propositional solver time : 0.000
% 0.20/0.56 # Success case prop preproc time : 0.000
% 0.20/0.56 # Success case prop encoding time : 0.000
% 0.20/0.56 # Success case prop solver time : 0.000
% 0.20/0.56 # Current number of processed clauses : 171
% 0.20/0.56 # Positive orientable unit clauses : 19
% 0.20/0.56 # Positive unorientable unit clauses: 0
% 0.20/0.56 # Negative unit clauses : 2
% 0.20/0.56 # Non-unit-clauses : 150
% 0.20/0.56 # Current number of unprocessed clauses: 377
% 0.20/0.56 # ...number of literals in the above : 2307
% 0.20/0.56 # Current number of archived formulas : 0
% 0.20/0.56 # Current number of archived clauses : 263
% 0.20/0.56 # Clause-clause subsumption calls (NU) : 18378
% 0.20/0.56 # Rec. Clause-clause subsumption calls : 4568
% 0.20/0.56 # Non-unit clause-clause subsumptions : 97
% 0.20/0.56 # Unit Clause-clause subsumption calls : 71
% 0.20/0.56 # Rewrite failures with RHS unbound : 0
% 0.20/0.56 # BW rewrite match attempts : 2
% 0.20/0.56 # BW rewrite match successes : 2
% 0.20/0.56 # Condensation attempts : 0
% 0.20/0.56 # Condensation successes : 0
% 0.20/0.56 # Termbank termtop insertions : 28854
% 0.20/0.56 # Search garbage collected termcells : 4427
% 0.20/0.56
% 0.20/0.56 # -------------------------------------------------
% 0.20/0.56 # User time : 0.056 s
% 0.20/0.56 # System time : 0.010 s
% 0.20/0.56 # Total time : 0.066 s
% 0.20/0.56 # Maximum resident set size: 2492 pages
% 0.20/0.56
% 0.20/0.56 # -------------------------------------------------
% 0.20/0.56 # User time : 0.246 s
% 0.20/0.56 # System time : 0.033 s
% 0.20/0.56 # Total time : 0.279 s
% 0.20/0.56 # Maximum resident set size: 1824 pages
% 0.20/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------