%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC299-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:43:50 PM UTC 2026
% Result : Unsatisfiable 1.42s 0.71s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 27
% Syntax : Number of clauses : 97 ( 33 unt; 11 nHn; 86 RR)
% Number of literals : 265 ( 48 equ; 171 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 133 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_12,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause181,axiom,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause114,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(co1_13,negated_conjecture,
lt(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause66,axiom,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(co1_24,negated_conjecture,
( nil = sk3
| cons(sk10,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_24) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| ssItem(sk10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause3) ).
cnf(c_0_27,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_28,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_27 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_31,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_29 ).
cnf(c_0_33,axiom,
ssList(nil),
clause8 ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_30 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_36,plain,
( ~ duplicatefreeP(app(cons(X1,X2),cons(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(cons(X1,X2),cons(X1,X3)))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_35 ).
cnf(c_0_38,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_40,plain,
( ~ duplicatefreeP(app(cons(skaf44(X1),X2),X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(cons(skaf44(X1),X2),X1))
| ~ singletonP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_33])]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_39 ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_44,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_45,plain,
( ~ duplicatefreeP(app(X1,X1))
| ~ ssList(X1)
| ~ ssList(app(X1,X1))
| ~ singletonP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_33])]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_41 ).
cnf(c_0_47,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_43 ).
cnf(c_0_49,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_12 ).
cnf(c_0_50,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_44 ).
cnf(c_0_51,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_52,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_53,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,nil)))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_34]),c_0_47]) ).
cnf(c_0_54,plain,
( ~ ssList(X3)
| ~ ssItem(X2)
| duplicatefreeP(cons(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_34]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_56,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_57,plain,
( ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_34]),c_0_56]),c_0_33])]) ).
cnf(c_0_59,plain,
( ~ ssItem(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_34]),c_0_33])]) ).
cnf(c_0_60,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_61,negated_conjecture,
app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_46]),c_0_56]),c_0_52])]) ).
cnf(c_0_62,negated_conjecture,
ssList(sk9),
co1_11 ).
cnf(c_0_63,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_61]),c_0_62])]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ssList(cons(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_63])]) ).
cnf(c_0_66,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_67,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_33])]) ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_66 ).
cnf(c_0_70,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_71,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
c_0_67 ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_51])]) ).
cnf(c_0_73,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_70 ).
cnf(c_0_74,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause114]) ).
cnf(c_0_75,plain,
( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_71]) ).
cnf(c_0_76,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_65]),c_0_52])]) ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| app(cons(X1,X2),X3) = cons(X1,app(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_63])]) ).
cnf(c_0_78,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
c_0_74 ).
cnf(c_0_79,negated_conjecture,
lt(sk6,sk5),
co1_13 ).
cnf(c_0_80,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_81,negated_conjecture,
( nil = sk3
| cons(sk10,nil) = sk3 ),
co1_24 ).
cnf(c_0_82,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_83,negated_conjecture,
( nil = sk3
| ssItem(sk10) ),
co1_15 ).
cnf(c_0_84,plain,
( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| lt(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_63]),c_0_63])]) ).
cnf(c_0_85,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),cons(sk6,app(nil,sk9))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_62]),c_0_33])]) ).
cnf(c_0_86,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_87,negated_conjecture,
~ lt(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_60]),c_0_56])]) ).
cnf(c_0_88,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
c_0_80 ).
cnf(c_0_89,negated_conjecture,
( nil = sk1
| cons(sk10,nil) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_82]) ).
cnf(c_0_90,negated_conjecture,
( ssItem(sk10)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_83,c_0_82]) ).
cnf(c_0_91,negated_conjecture,
( ~ strictorderedP(sk1)
| ~ ssList(app(nil,sk9)) ),
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_84,c_0_85]),c_0_86]),c_0_52]),c_0_51])]),c_0_87]) ).
cnf(c_0_92,negated_conjecture,
( strictorderedP(sk1)
| nil = sk1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
~ strictorderedP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_32]),c_0_62])]) ).
cnf(c_0_94,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_95,negated_conjecture,
nil = sk1,
inference(sr,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_96,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95]),c_0_93]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC299-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:13:19 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.42/0.71 % Version: 3.5.1
% 1.42/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.42/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.42/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.42/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.42/0.71 % Starting sh5l with 300s (1) cores
% 1.42/0.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3613031 completed with status 0
% 1.42/0.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.42/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.42/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.42/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.42/0.71 % No SInE strategy applied
% 1.42/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.42/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.42/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.42/0.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.42/0.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.42/0.71 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.42/0.71 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 3613040 completed with status 0
% 1.42/0.71 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 1.42/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.42/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.42/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.42/0.71 % No SInE strategy applied
% 1.42/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.42/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.42/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.42/0.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.42/0.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.42/0.71 % Preprocessing time : 0.006 s
% 1.42/0.71
% 1.42/0.71 % Proof found!
% 1.42/0.71 % SZS status Unsatisfiable
% 1.42/0.71 % SZS output start CNFRefutation
% See solution above
% 1.42/0.71 % Parsed axioms : 212
% 1.42/0.71 % Removed by relevancy pruning/SinE : 0
% 1.42/0.71 % Initial clauses : 212
% 1.42/0.71 % Removed in clause preprocessing : 0
% 1.42/0.71 % Initial clauses in saturation : 212
% 1.42/0.71 % Processed clauses : 931
% 1.42/0.71 % ...of these trivial : 13
% 1.42/0.71 % ...subsumed : 220
% 1.42/0.71 % ...remaining for further processing : 698
% 1.42/0.71 % Other redundant clauses eliminated : 72
% 1.42/0.71 % Clauses deleted for lack of memory : 0
% 1.42/0.71 % Backward-subsumed : 92
% 1.42/0.71 % Backward-rewritten : 335
% 1.42/0.71 % Generated clauses : 2871
% 1.42/0.71 % ...of the previous two non-redundant : 2779
% 1.42/0.71 % ...aggressively subsumed : 0
% 1.42/0.71 % Contextual simplify-reflections : 107
% 1.42/0.71 % Paramodulations : 2791
% 1.42/0.71 % Factorizations : 0
% 1.42/0.71 % NegExts : 0
% 1.42/0.71 % Equation resolutions : 79
% 1.42/0.71 % Disequality decompositions : 0
% 1.42/0.71 % Total rewrite steps : 2811
% 1.42/0.71 % ...of those cached : 2659
% 1.42/0.71 % Propositional unsat checks : 0
% 1.42/0.71 % Propositional check models : 0
% 1.42/0.71 % Propositional check unsatisfiable : 0
% 1.42/0.71 % Propositional clauses : 0
% 1.42/0.71 % Propositional clauses after purity: 0
% 1.42/0.71 % Propositional unsat core size : 0
% 1.42/0.71 % Propositional preprocessing time : 0.000
% 1.42/0.71 % Propositional encoding time : 0.000
% 1.42/0.71 % Propositional solver time : 0.000
% 1.42/0.71 % Success case prop preproc time : 0.000
% 1.42/0.71 % Success case prop encoding time : 0.000
% 1.42/0.71 % Success case prop solver time : 0.000
% 1.42/0.71 % Current number of processed clauses : 246
% 1.42/0.71 % Positive orientable unit clauses : 79
% 1.42/0.71 % Positive unorientable unit clauses: 0
% 1.42/0.71 % Negative unit clauses : 6
% 1.42/0.71 % Non-unit-clauses : 161
% 1.42/0.71 % Current number of unprocessed clauses: 1851
% 1.42/0.71 % ...number of literals in the above : 9771
% 1.42/0.71 % Current number of archived formulas : 0
% 1.42/0.71 % Current number of archived clauses : 429
% 1.42/0.71 % Clause-clause subsumption calls (NU) : 33277
% 1.42/0.71 % Rec. Clause-clause subsumption calls : 11847
% 1.42/0.71 % Non-unit clause-clause subsumptions : 359
% 1.42/0.71 % Unit Clause-clause subsumption calls : 1061
% 1.42/0.71 % Rewrite failures with RHS unbound : 0
% 1.42/0.71 % BW rewrite match attempts : 74
% 1.42/0.71 % BW rewrite match successes : 46
% 1.42/0.71 % Condensation attempts : 0
% 1.42/0.71 % Condensation successes : 0
% 1.42/0.71 % Termbank termtop insertions : 63356
% 1.42/0.71 % Search garbage collected termcells : 545
% 1.42/0.71
% 1.42/0.71 % -------------------------------------------------
% 1.42/0.71 % User time : 0.199 s
% 1.42/0.71 % System time : 0.017 s
% 1.42/0.71 % Total time : 0.215 s
% 1.42/0.71 % Maximum resident set size: 3820 pages
% 1.42/0.71
% 1.42/0.71 % -------------------------------------------------
% 1.42/0.71 % User time : 0.893 s
% 1.42/0.71 % System time : 0.065 s
% 1.42/0.71 % Total time : 0.958 s
% 1.42/0.71 % Maximum resident set size: 4864 pages
% 1.42/0.71 % E exiting
%------------------------------------------------------------------------------