TSTP Solution File: SWC245-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC245-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:52 EDT 2024
% Result : Unsatisfiable 4.24s 1.03s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 30
% Syntax : Number of clauses : 99 ( 32 unt; 13 nHn; 93 RR)
% Number of literals : 296 ( 75 equ; 196 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 156 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause103,axiom,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(co1_11,negated_conjecture,
( lt(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(X1,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(co1_14,negated_conjecture,
app(sk3,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_13,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(c_0_30,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_31,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_32,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_33,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_34,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_35,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_36,negated_conjecture,
( lt(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_37,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(X1,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_39,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_30 ).
cnf(c_0_40,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_31 ).
cnf(c_0_41,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_32 ).
cnf(c_0_42,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_33 ).
cnf(c_0_43,axiom,
ssList(nil),
clause8 ).
cnf(c_0_44,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_34 ).
cnf(c_0_45,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_46,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_35 ).
cnf(c_0_47,negated_conjecture,
( lt(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_36 ).
cnf(c_0_48,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_37 ).
cnf(c_0_49,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(X1,sk5(X3,X2,X1)) ),
c_0_38 ).
cnf(c_0_50,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_51,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_52,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_42])]),c_0_43])]) ).
cnf(c_0_53,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_54,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_45 ).
cnf(c_0_55,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_56,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_57,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_58,negated_conjecture,
app(sk3,sk6) = sk4,
co1_14 ).
cnf(c_0_59,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_60,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_61,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_62,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != sk1
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_63,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_64,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_65,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_66,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_67,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_43])]) ).
cnf(c_0_68,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_43])]),c_0_39]) ).
cnf(c_0_69,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_55 ).
cnf(c_0_70,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_71,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_56 ).
cnf(c_0_72,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_73,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_74,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_75,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_57 ).
cnf(c_0_76,negated_conjecture,
app(sk1,sk6) = sk4,
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_77,negated_conjecture,
ssList(sk6),
co1_13 ).
cnf(c_0_78,negated_conjecture,
nil != sk1,
c_0_60 ).
cnf(c_0_79,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_80,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_81,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_61 ).
cnf(c_0_82,negated_conjecture,
( ~ segmentP(sk1,cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65])])]),c_0_66])]),c_0_67]) ).
cnf(c_0_83,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_84,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_71]) ).
cnf(c_0_85,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_72 ).
cnf(c_0_86,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_73 ).
cnf(c_0_87,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_74 ).
cnf(c_0_88,negated_conjecture,
hd(sk4) = hd(sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_66]),c_0_77])]),c_0_78]) ).
cnf(c_0_89,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_90,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_76]),c_0_77]),c_0_66])]),c_0_78]) ).
cnf(c_0_91,negated_conjecture,
( ~ frontsegP(sk1,cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_66])]),c_0_67]) ).
cnf(c_0_92,plain,
( nil = X1
| frontsegP(X1,cons(hd(X1),X2))
| ~ frontsegP(tl(X1),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_87]) ).
cnf(c_0_93,negated_conjecture,
ssItem(hd(sk1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]),c_0_90]) ).
cnf(c_0_94,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_95,negated_conjecture,
~ frontsegP(tl(sk1),nil),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_43]),c_0_66])]),c_0_78]) ).
cnf(c_0_96,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_94 ).
cnf(c_0_97,negated_conjecture,
~ ssList(tl(sk1)),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_86]),c_0_66])]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC245-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:23:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 4.24/1.03 # Version: 3.1.0
% 4.24/1.03 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.24/1.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.24/1.03 # Starting new_bool_3 with 300s (1) cores
% 4.24/1.03 # Starting new_bool_1 with 300s (1) cores
% 4.24/1.03 # Starting sh5l with 300s (1) cores
% 4.24/1.03 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6669 completed with status 0
% 4.24/1.03 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.24/1.03 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.24/1.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.24/1.03 # No SInE strategy applied
% 4.24/1.03 # Search class: FGHSM-FSLM31-MFFFFFNN
% 4.24/1.03 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.24/1.03 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 4.24/1.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.24/1.03 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 4.24/1.03 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.24/1.03 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 4.24/1.03 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6676 completed with status 0
% 4.24/1.03 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.24/1.03 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.24/1.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.24/1.03 # No SInE strategy applied
% 4.24/1.03 # Search class: FGHSM-FSLM31-MFFFFFNN
% 4.24/1.03 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.24/1.03 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 4.24/1.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.24/1.03 # Preprocessing time : 0.003 s
% 4.24/1.03 # Presaturation interreduction done
% 4.24/1.03
% 4.24/1.03 # Proof found!
% 4.24/1.03 # SZS status Unsatisfiable
% 4.24/1.03 # SZS output start CNFRefutation
% See solution above
% 4.24/1.03 # Parsed axioms : 202
% 4.24/1.03 # Removed by relevancy pruning/SinE : 0
% 4.24/1.03 # Initial clauses : 202
% 4.24/1.03 # Removed in clause preprocessing : 0
% 4.24/1.03 # Initial clauses in saturation : 202
% 4.24/1.03 # Processed clauses : 5368
% 4.24/1.03 # ...of these trivial : 80
% 4.24/1.03 # ...subsumed : 3604
% 4.24/1.03 # ...remaining for further processing : 1684
% 4.24/1.03 # Other redundant clauses eliminated : 296
% 4.24/1.03 # Clauses deleted for lack of memory : 0
% 4.24/1.03 # Backward-subsumed : 109
% 4.24/1.03 # Backward-rewritten : 82
% 4.24/1.03 # Generated clauses : 30110
% 4.24/1.03 # ...of the previous two non-redundant : 27946
% 4.24/1.03 # ...aggressively subsumed : 0
% 4.24/1.03 # Contextual simplify-reflections : 271
% 4.24/1.03 # Paramodulations : 29810
% 4.24/1.03 # Factorizations : 0
% 4.24/1.03 # NegExts : 0
% 4.24/1.03 # Equation resolutions : 301
% 4.24/1.03 # Disequality decompositions : 0
% 4.24/1.03 # Total rewrite steps : 25288
% 4.24/1.03 # ...of those cached : 24926
% 4.24/1.03 # Propositional unsat checks : 0
% 4.24/1.03 # Propositional check models : 0
% 4.24/1.03 # Propositional check unsatisfiable : 0
% 4.24/1.03 # Propositional clauses : 0
% 4.24/1.03 # Propositional clauses after purity: 0
% 4.24/1.03 # Propositional unsat core size : 0
% 4.24/1.03 # Propositional preprocessing time : 0.000
% 4.24/1.03 # Propositional encoding time : 0.000
% 4.24/1.03 # Propositional solver time : 0.000
% 4.24/1.03 # Success case prop preproc time : 0.000
% 4.24/1.03 # Success case prop encoding time : 0.000
% 4.24/1.03 # Success case prop solver time : 0.000
% 4.24/1.03 # Current number of processed clauses : 1277
% 4.24/1.03 # Positive orientable unit clauses : 115
% 4.24/1.03 # Positive unorientable unit clauses: 0
% 4.24/1.03 # Negative unit clauses : 21
% 4.24/1.03 # Non-unit-clauses : 1141
% 4.24/1.03 # Current number of unprocessed clauses: 22853
% 4.24/1.03 # ...number of literals in the above : 115749
% 4.24/1.03 # Current number of archived formulas : 0
% 4.24/1.03 # Current number of archived clauses : 384
% 4.24/1.03 # Clause-clause subsumption calls (NU) : 229390
% 4.24/1.03 # Rec. Clause-clause subsumption calls : 59618
% 4.24/1.03 # Non-unit clause-clause subsumptions : 3171
% 4.24/1.03 # Unit Clause-clause subsumption calls : 6516
% 4.24/1.03 # Rewrite failures with RHS unbound : 0
% 4.24/1.03 # BW rewrite match attempts : 15
% 4.24/1.03 # BW rewrite match successes : 15
% 4.24/1.03 # Condensation attempts : 0
% 4.24/1.03 # Condensation successes : 0
% 4.24/1.03 # Termbank termtop insertions : 515942
% 4.24/1.03 # Search garbage collected termcells : 563
% 4.24/1.03
% 4.24/1.03 # -------------------------------------------------
% 4.24/1.03 # User time : 0.491 s
% 4.24/1.03 # System time : 0.021 s
% 4.24/1.03 # Total time : 0.512 s
% 4.24/1.03 # Maximum resident set size: 2136 pages
% 4.24/1.03
% 4.24/1.03 # -------------------------------------------------
% 4.24/1.03 # User time : 2.402 s
% 4.24/1.03 # System time : 0.102 s
% 4.24/1.03 # Total time : 2.504 s
% 4.24/1.03 # Maximum resident set size: 1880 pages
% 4.24/1.03 % E---3.1 exiting
% 4.24/1.03 % E exiting
%------------------------------------------------------------------------------