TSTP Solution File: SWC093-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC093-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:14 EDT 2024
% Result : Unsatisfiable 2.11s 0.73s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 26
% Syntax : Number of clauses : 100 ( 28 unt; 9 nHn; 85 RR)
% Number of literals : 284 ( 51 equ; 189 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 151 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_12,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_26,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_27,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_28,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_29,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_30,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_31,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_29 ).
cnf(c_0_34,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_35,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_36,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_37,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_38,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_30 ).
cnf(c_0_39,negated_conjecture,
cons(sk5,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_32])]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_42,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_43,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_34 ).
cnf(c_0_44,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_35 ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_36 ).
cnf(c_0_47,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_48,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_37 ).
cnf(c_0_49,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_50,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,plain,
( app(cons(X1,X2),cons(X1,X3)) != X4
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(X4) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),c_0_46]) ).
cnf(c_0_52,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_47 ).
cnf(c_0_53,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_54,plain,
( cons(X1,cons(X1,X2)) != X3
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_38]),c_0_45])]),c_0_46]) ).
cnf(c_0_55,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( cons(sk5,sk3) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_39]),c_0_40]),c_0_45])]) ).
cnf(c_0_57,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,sk3)) ),
inference(spm,[status(thm)],[c_0_55,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_59,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_60,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,sk3)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,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_62,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_63,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_58 ).
cnf(c_0_65,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_59 ).
cnf(c_0_66,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_46]),c_0_40]),c_0_50])]) ).
cnf(c_0_67,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_61 ).
cnf(c_0_68,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_69,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_62 ).
cnf(c_0_70,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_71,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_63 ).
cnf(c_0_72,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_42]),c_0_28]) ).
cnf(c_0_73,plain,
( X1 = X2
| neq(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66])]) ).
cnf(c_0_74,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_44]),c_0_45])]) ).
cnf(c_0_75,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_68 ).
cnf(c_0_76,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_77,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_67,c_0_69]) ).
cnf(c_0_78,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_70 ).
cnf(c_0_79,negated_conjecture,
( frontsegP(X1,sk3)
| cons(sk5,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_49]),c_0_50])]) ).
cnf(c_0_80,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_66])]) ).
cnf(c_0_81,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_82,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_83,negated_conjecture,
( nil = X1
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_84,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])])]) ).
cnf(c_0_85,negated_conjecture,
( segmentP(X1,sk3)
| app(X2,cons(sk5,X3)) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_49]),c_0_50])]) ).
cnf(c_0_86,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_66])]) ).
cnf(c_0_87,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_88,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_89,negated_conjecture,
( frontsegP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_79]),c_0_80]) ).
cnf(c_0_90,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
c_0_81 ).
cnf(c_0_91,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_92,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_82 ).
cnf(c_0_93,negated_conjecture,
( nil = X1
| ~ frontsegP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_50])]) ).
cnf(c_0_94,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]),c_0_88])])]) ).
cnf(c_0_95,negated_conjecture,
frontsegP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_39]),c_0_45])]) ).
cnf(c_0_96,negated_conjecture,
memberP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_32])]) ).
cnf(c_0_97,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_91,c_0_28]) ).
cnf(c_0_98,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_39]),c_0_40]),c_0_45])]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_50]),c_0_96]),c_0_97])]),c_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC093-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:24:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 2.11/0.73 # Version: 3.1.0
% 2.11/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.11/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.11/0.73 # Starting new_bool_3 with 300s (1) cores
% 2.11/0.73 # Starting new_bool_1 with 300s (1) cores
% 2.11/0.73 # Starting sh5l with 300s (1) cores
% 2.11/0.73 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17427 completed with status 0
% 2.11/0.73 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.11/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.11/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.11/0.73 # No SInE strategy applied
% 2.11/0.73 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.11/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.11/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.11/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.11/0.73 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.11/0.73 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.11/0.73 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.11/0.73 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 17437 completed with status 0
% 2.11/0.73 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 2.11/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.11/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.11/0.73 # No SInE strategy applied
% 2.11/0.73 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.11/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.11/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.11/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.11/0.73 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.11/0.73 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.11/0.73 # Preprocessing time : 0.004 s
% 2.11/0.73
% 2.11/0.73 # Proof found!
% 2.11/0.73 # SZS status Unsatisfiable
% 2.11/0.73 # SZS output start CNFRefutation
% See solution above
% 2.11/0.73 # Parsed axioms : 197
% 2.11/0.73 # Removed by relevancy pruning/SinE : 0
% 2.11/0.73 # Initial clauses : 197
% 2.11/0.73 # Removed in clause preprocessing : 0
% 2.11/0.73 # Initial clauses in saturation : 197
% 2.11/0.73 # Processed clauses : 1485
% 2.11/0.73 # ...of these trivial : 38
% 2.11/0.73 # ...subsumed : 513
% 2.11/0.73 # ...remaining for further processing : 934
% 2.11/0.73 # Other redundant clauses eliminated : 82
% 2.11/0.73 # Clauses deleted for lack of memory : 0
% 2.11/0.73 # Backward-subsumed : 127
% 2.11/0.73 # Backward-rewritten : 148
% 2.11/0.73 # Generated clauses : 11898
% 2.11/0.73 # ...of the previous two non-redundant : 11123
% 2.11/0.73 # ...aggressively subsumed : 0
% 2.11/0.73 # Contextual simplify-reflections : 50
% 2.11/0.73 # Paramodulations : 11514
% 2.11/0.73 # Factorizations : 186
% 2.11/0.73 # NegExts : 0
% 2.11/0.73 # Equation resolutions : 197
% 2.11/0.73 # Disequality decompositions : 0
% 2.11/0.73 # Total rewrite steps : 5861
% 2.11/0.73 # ...of those cached : 5512
% 2.11/0.73 # Propositional unsat checks : 0
% 2.11/0.73 # Propositional check models : 0
% 2.11/0.73 # Propositional check unsatisfiable : 0
% 2.11/0.73 # Propositional clauses : 0
% 2.11/0.73 # Propositional clauses after purity: 0
% 2.11/0.73 # Propositional unsat core size : 0
% 2.11/0.73 # Propositional preprocessing time : 0.000
% 2.11/0.73 # Propositional encoding time : 0.000
% 2.11/0.73 # Propositional solver time : 0.000
% 2.11/0.73 # Success case prop preproc time : 0.000
% 2.11/0.73 # Success case prop encoding time : 0.000
% 2.11/0.73 # Success case prop solver time : 0.000
% 2.11/0.73 # Current number of processed clauses : 653
% 2.11/0.73 # Positive orientable unit clauses : 79
% 2.11/0.73 # Positive unorientable unit clauses: 0
% 2.11/0.73 # Negative unit clauses : 17
% 2.11/0.73 # Non-unit-clauses : 557
% 2.11/0.73 # Current number of unprocessed clauses: 8927
% 2.11/0.73 # ...number of literals in the above : 40161
% 2.11/0.73 # Current number of archived formulas : 0
% 2.11/0.73 # Current number of archived clauses : 276
% 2.11/0.73 # Clause-clause subsumption calls (NU) : 71908
% 2.11/0.73 # Rec. Clause-clause subsumption calls : 19030
% 2.11/0.73 # Non-unit clause-clause subsumptions : 449
% 2.11/0.73 # Unit Clause-clause subsumption calls : 2832
% 2.11/0.73 # Rewrite failures with RHS unbound : 0
% 2.11/0.73 # BW rewrite match attempts : 41
% 2.11/0.73 # BW rewrite match successes : 32
% 2.11/0.73 # Condensation attempts : 0
% 2.11/0.73 # Condensation successes : 0
% 2.11/0.73 # Termbank termtop insertions : 201001
% 2.11/0.73 # Search garbage collected termcells : 544
% 2.11/0.73
% 2.11/0.73 # -------------------------------------------------
% 2.11/0.73 # User time : 0.223 s
% 2.11/0.73 # System time : 0.011 s
% 2.11/0.73 # Total time : 0.234 s
% 2.11/0.73 # Maximum resident set size: 2136 pages
% 2.11/0.73
% 2.11/0.73 # -------------------------------------------------
% 2.11/0.73 # User time : 1.123 s
% 2.11/0.73 # System time : 0.044 s
% 2.11/0.73 # Total time : 1.167 s
% 2.11/0.73 # Maximum resident set size: 1876 pages
% 2.11/0.73 % E---3.1 exiting
% 2.11/0.73 % E exiting
%------------------------------------------------------------------------------