TSTP Solution File: SWC075-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC075-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:23:04 EDT 2024
% Result : Unsatisfiable 1.03s 0.61s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of clauses : 97 ( 32 unt; 3 nHn; 97 RR)
% Number of literals : 250 ( 112 equ; 157 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_11,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_12,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_22,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_23,negated_conjecture,
app(sk6,sk5) = sk3,
co1_11 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_26,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_29,negated_conjecture,
ssList(sk5),
co1_8 ).
cnf(c_0_30,negated_conjecture,
app(sk5,sk6) = sk4,
co1_10 ).
cnf(c_0_31,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_32,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_25 ).
cnf(c_0_33,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_34,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_35,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_36,negated_conjecture,
( app(sk6,app(sk5,X1)) = app(sk1,X1)
| ~ ssList(X1) ),
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_29])]) ).
cnf(c_0_37,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( X1 = sk6
| app(X1,sk5) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_39,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_33 ).
cnf(c_0_40,axiom,
ssList(nil),
clause8 ).
cnf(c_0_41,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_42,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_43,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_35 ).
cnf(c_0_44,negated_conjecture,
app(sk6,sk2) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28])]) ).
cnf(c_0_45,negated_conjecture,
( sk6 = nil
| sk5 != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_29])]) ).
cnf(c_0_46,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_41]),c_0_27]),c_0_40]),c_0_29])]) ).
cnf(c_0_47,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_48,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_50,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_51,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_43]) ).
cnf(c_0_52,negated_conjecture,
( app(nil,sk2) = sk1
| sk5 != sk1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_54,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_39]),c_0_40])]) ).
cnf(c_0_55,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_47 ).
cnf(c_0_56,negated_conjecture,
( app(sk5,nil) = sk2
| sk5 != sk1 ),
inference(spm,[status(thm)],[c_0_37,c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( X1 = sk6
| app(sk5,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_37]),c_0_28]),c_0_29])]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_49 ).
cnf(c_0_59,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_50 ).
cnf(c_0_60,negated_conjecture,
( segmentP(app(sk2,X1),sk6)
| ~ ssList(app(sk2,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_37]),c_0_28]),c_0_29])]) ).
cnf(c_0_61,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_62,negated_conjecture,
( X1 = sk2
| app(nil,X1) != sk1
| sk5 != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_52]),c_0_53]),c_0_40])]) ).
cnf(c_0_63,negated_conjecture,
app(nil,app(sk1,sk6)) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_28]),c_0_53])]) ).
cnf(c_0_64,negated_conjecture,
ssList(app(sk1,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_44]),c_0_28]),c_0_53])]) ).
cnf(c_0_65,negated_conjecture,
( app(sk1,sk6) = sk1
| sk5 != sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_56]),c_0_40])]),c_0_44]),c_0_46]) ).
cnf(c_0_66,negated_conjecture,
( X1 = sk5
| app(sk6,X1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_27]),c_0_29]),c_0_28])]) ).
cnf(c_0_67,negated_conjecture,
( sk6 = nil
| sk5 != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_41]),c_0_40]),c_0_29])]) ).
cnf(c_0_68,negated_conjecture,
( nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_40])]) ).
cnf(c_0_69,negated_conjecture,
segmentP(sk2,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_41]),c_0_53]),c_0_40])]) ).
cnf(c_0_70,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_51,c_0_39]),c_0_40])]),c_0_55]) ).
cnf(c_0_71,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_61 ).
cnf(c_0_72,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_73,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_74,negated_conjecture,
( segmentP(app(sk1,X1),sk5)
| ~ ssList(app(sk1,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_27]),c_0_29]),c_0_28])]) ).
cnf(c_0_75,negated_conjecture,
( app(sk1,sk6) = sk2
| sk5 != sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),c_0_65]) ).
cnf(c_0_76,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_77,negated_conjecture,
( X1 = sk5
| app(nil,X1) != sk1
| sk5 != sk2
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_78,negated_conjecture,
( sk5 = sk2
| app(sk1,sk6) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_44]),c_0_53])]) ).
cnf(c_0_79,negated_conjecture,
( sk6 = nil
| ~ segmentP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_28])]) ).
cnf(c_0_80,negated_conjecture,
segmentP(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_27]),c_0_29]),c_0_28])]) ).
cnf(c_0_81,negated_conjecture,
( sk5 = nil
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_27]),c_0_29]),c_0_28])]) ).
cnf(c_0_82,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_72 ).
cnf(c_0_83,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_73 ).
cnf(c_0_84,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_85,negated_conjecture,
( segmentP(sk2,sk5)
| sk5 != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_53]),c_0_28])]) ).
cnf(c_0_86,negated_conjecture,
segmentP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_41]),c_0_76]),c_0_40])]) ).
cnf(c_0_87,negated_conjecture,
( app(sk1,sk6) = sk5
| app(sk1,sk6) != sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_63]),c_0_64])]),c_0_78]) ).
cnf(c_0_88,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_89,negated_conjecture,
( app(nil,sk6) = sk2
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_37,c_0_81]) ).
cnf(c_0_90,negated_conjecture,
( sk6 = nil
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_27]),c_0_29]),c_0_28])]) ).
cnf(c_0_91,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_83])]),c_0_40])]) ).
cnf(c_0_92,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_84 ).
cnf(c_0_93,negated_conjecture,
( sk5 = nil
| sk5 != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_85]),c_0_86]),c_0_29])]) ).
cnf(c_0_94,negated_conjecture,
sk5 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_46]),c_0_88]),c_0_46])]) ).
cnf(c_0_95,negated_conjecture,
sk1 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92]) ).
cnf(c_0_96,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94]),c_0_94])]),c_0_95]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC075-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 02:59:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/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
% 1.03/0.61 # Version: 3.1.0
% 1.03/0.61 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.61 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.03/0.61 # Starting sh5l with 300s (1) cores
% 1.03/0.61 # new_bool_3 with pid 28789 completed with status 0
% 1.03/0.61 # Result found by new_bool_3
% 1.03/0.61 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.61 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.61 # Search class: FGHSF-FFMM22-SFFFFFNN
% 1.03/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.03/0.61 # SAT001_MinMin_p005000_rr_RG with pid 28795 completed with status 0
% 1.03/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.03/0.61 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.61 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.61 # Search class: FGHSF-FFMM22-SFFFFFNN
% 1.03/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.03/0.61 # Preprocessing time : 0.004 s
% 1.03/0.61 # Presaturation interreduction done
% 1.03/0.61
% 1.03/0.61 # Proof found!
% 1.03/0.61 # SZS status Unsatisfiable
% 1.03/0.61 # SZS output start CNFRefutation
% See solution above
% 1.03/0.61 # Parsed axioms : 197
% 1.03/0.61 # Removed by relevancy pruning/SinE : 156
% 1.03/0.61 # Initial clauses : 41
% 1.03/0.61 # Removed in clause preprocessing : 0
% 1.03/0.61 # Initial clauses in saturation : 41
% 1.03/0.61 # Processed clauses : 1024
% 1.03/0.61 # ...of these trivial : 55
% 1.03/0.61 # ...subsumed : 579
% 1.03/0.61 # ...remaining for further processing : 390
% 1.03/0.61 # Other redundant clauses eliminated : 16
% 1.03/0.61 # Clauses deleted for lack of memory : 0
% 1.03/0.61 # Backward-subsumed : 23
% 1.03/0.61 # Backward-rewritten : 174
% 1.03/0.61 # Generated clauses : 3714
% 1.03/0.61 # ...of the previous two non-redundant : 3541
% 1.03/0.61 # ...aggressively subsumed : 0
% 1.03/0.61 # Contextual simplify-reflections : 35
% 1.03/0.61 # Paramodulations : 3695
% 1.03/0.61 # Factorizations : 0
% 1.03/0.61 # NegExts : 0
% 1.03/0.61 # Equation resolutions : 20
% 1.03/0.61 # Disequality decompositions : 0
% 1.03/0.61 # Total rewrite steps : 4754
% 1.03/0.61 # ...of those cached : 4723
% 1.03/0.61 # Propositional unsat checks : 0
% 1.03/0.61 # Propositional check models : 0
% 1.03/0.61 # Propositional check unsatisfiable : 0
% 1.03/0.61 # Propositional clauses : 0
% 1.03/0.61 # Propositional clauses after purity: 0
% 1.03/0.61 # Propositional unsat core size : 0
% 1.03/0.61 # Propositional preprocessing time : 0.000
% 1.03/0.61 # Propositional encoding time : 0.000
% 1.03/0.61 # Propositional solver time : 0.000
% 1.03/0.61 # Success case prop preproc time : 0.000
% 1.03/0.61 # Success case prop encoding time : 0.000
% 1.03/0.61 # Success case prop solver time : 0.000
% 1.03/0.61 # Current number of processed clauses : 149
% 1.03/0.61 # Positive orientable unit clauses : 19
% 1.03/0.61 # Positive unorientable unit clauses: 0
% 1.03/0.61 # Negative unit clauses : 7
% 1.03/0.61 # Non-unit-clauses : 123
% 1.03/0.61 # Current number of unprocessed clauses: 2522
% 1.03/0.61 # ...number of literals in the above : 12839
% 1.03/0.61 # Current number of archived formulas : 0
% 1.03/0.61 # Current number of archived clauses : 236
% 1.03/0.61 # Clause-clause subsumption calls (NU) : 12466
% 1.03/0.61 # Rec. Clause-clause subsumption calls : 4587
% 1.03/0.61 # Non-unit clause-clause subsumptions : 440
% 1.03/0.61 # Unit Clause-clause subsumption calls : 542
% 1.03/0.61 # Rewrite failures with RHS unbound : 0
% 1.03/0.61 # BW rewrite match attempts : 7
% 1.03/0.61 # BW rewrite match successes : 7
% 1.03/0.61 # Condensation attempts : 0
% 1.03/0.61 # Condensation successes : 0
% 1.03/0.61 # Termbank termtop insertions : 65448
% 1.03/0.61 # Search garbage collected termcells : 916
% 1.03/0.61
% 1.03/0.61 # -------------------------------------------------
% 1.03/0.61 # User time : 0.087 s
% 1.03/0.61 # System time : 0.008 s
% 1.03/0.61 # Total time : 0.095 s
% 1.03/0.61 # Maximum resident set size: 2076 pages
% 1.03/0.61
% 1.03/0.61 # -------------------------------------------------
% 1.03/0.61 # User time : 0.092 s
% 1.03/0.61 # System time : 0.010 s
% 1.03/0.61 # Total time : 0.102 s
% 1.03/0.61 # Maximum resident set size: 1872 pages
% 1.03/0.61 % E---3.1 exiting
% 1.03/0.61 % E exiting
%------------------------------------------------------------------------------