%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC394-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 : n017.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:44:14 PM UTC 2026
% Result : Unsatisfiable 9.13s 6.67s
% Output : CNFRefutation 9.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 28
% Syntax : Number of clauses : 100 ( 39 unt; 8 nHn; 80 RR)
% Number of literals : 253 ( 32 equ; 159 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 : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 149 ( 33 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(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause136,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause58,axiom,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
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(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause141,axiom,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause168,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(co1_13,negated_conjecture,
( segmentP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
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(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 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_30,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_28 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_33,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_34,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_37,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_30]) ).
cnf(c_0_38,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[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_39,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_40,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_35 ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_36 ).
cnf(c_0_43,negated_conjecture,
( ~ duplicatefreeP(app(sk1,cons(sk5,X1)))
| ~ ssList(X1)
| ~ ssList(app(sk1,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33]),c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| duplicatefreeP(app(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(sk5,X2))
| ~ ssList(app(sk1,cons(sk5,X2)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_34])]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_45 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(app(sk1,cons(sk5,X2)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(sk5,X2))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_42]),c_0_34])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
c_0_49 ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
c_0_50 ).
cnf(c_0_54,axiom,
ssList(nil),
clause8 ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_47]),c_0_33])]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(app(X1,X2),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_57,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_55,c_0_40]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(cons(sk5,skaf43(sk5,sk1)))
| rearsegP(sk1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_38]),c_0_40])]) ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ssList(cons(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_57])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_58 ).
cnf(c_0_63,negated_conjecture,
rearsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_39])]) ).
cnf(c_0_64,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_65,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_61 ).
cnf(c_0_66,negated_conjecture,
app(skaf46(sk1,nil),nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_54]),c_0_34])]) ).
cnf(c_0_67,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_68,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_69,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_70,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_64 ).
cnf(c_0_71,negated_conjecture,
skaf46(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_72,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_68 ).
cnf(c_0_73,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_69 ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_70]),c_0_42]) ).
cnf(c_0_75,negated_conjecture,
app(sk1,nil) = sk1,
inference(rw,[status(thm)],[c_0_66,c_0_71]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_77,negated_conjecture,
( segmentP(sk4,sk3)
| nil = sk3 ),
co1_13 ).
cnf(c_0_78,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_79,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_80,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_81,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_82,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X3)
| memberP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_57])]) ).
cnf(c_0_84,negated_conjecture,
( ~ ssList(X1)
| memberP(app(X1,sk1),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_85,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,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_54]),c_0_34])]) ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
c_0_76 ).
cnf(c_0_87,negated_conjecture,
( segmentP(sk4,sk1)
| nil = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_78]) ).
cnf(c_0_88,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,negated_conjecture,
~ memberP(sk2,sk5),
c_0_81 ).
cnf(c_0_90,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_82 ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| memberP(app(app(X1,sk1),X2),sk5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_92,negated_conjecture,
( nil = sk1
| app(app(skaf47(sk4,sk1),sk1),skaf48(sk1,sk4)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_34]),c_0_88])]) ).
cnf(c_0_93,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_94,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_95,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_89,c_0_80]) ).
cnf(c_0_96,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_57])]) ).
cnf(c_0_97,negated_conjecture,
nil = sk1,
inference(sr,[status(thm)],[inference(cn,[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_94])]),c_0_95]) ).
cnf(c_0_98,plain,
~ memberP(sk1,X1),
inference(rw,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_32,c_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC394-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.12/5.40 % Computer : n017.cluster.edu
% 0.12/5.40 % Model : x86_64 x86_64
% 0.12/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.40 % Memory : 8046.5625MB
% 0.12/5.40 % OS : Linux 6.8.0-71-generic
% 0.12/5.40 % CPULimit : 300
% 0.12/5.40 % WCLimit : 300
% 0.12/5.40 % DateTime : Mon Sep 21 08:16:02 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.12/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.45 Running first-order theorem proving
% 0.12/5.45 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
% 9.13/6.67 % Version: 3.5.1
% 9.13/6.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.13/6.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.13/6.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.13/6.67 % Starting new_bool_3 with 300s (1) cores
% 9.13/6.67 % Starting new_bool_1 with 300s (1) cores
% 9.13/6.67 % Starting sh5l with 300s (1) cores
% 9.13/6.67 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1875995 completed with status 0
% 9.13/6.67 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 9.13/6.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.13/6.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.13/6.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.13/6.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.13/6.67 % No SInE strategy applied
% 9.13/6.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 9.13/6.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 9.13/6.67 % Starting SubtermCWHack with 136s (1) cores
% 9.13/6.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 9.13/6.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 9.13/6.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 9.13/6.67 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 9.13/6.67 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1876004 completed with status 0
% 9.13/6.67 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 9.13/6.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.13/6.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.13/6.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.13/6.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.13/6.67 % No SInE strategy applied
% 9.13/6.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 9.13/6.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 9.13/6.67 % Starting SubtermCWHack with 136s (1) cores
% 9.13/6.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 9.13/6.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 9.13/6.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 9.13/6.67 % Preprocessing time : 0.003 s
% 9.13/6.67
% 9.13/6.67 % Proof found!
% 9.13/6.67 % SZS status Unsatisfiable
% 9.13/6.67 % SZS output start CNFRefutation
% See solution above
% 9.13/6.67 % Parsed axioms : 198
% 9.13/6.67 % Removed by relevancy pruning/SinE : 0
% 9.13/6.67 % Initial clauses : 198
% 9.13/6.67 % Removed in clause preprocessing : 0
% 9.13/6.67 % Initial clauses in saturation : 198
% 9.13/6.67 % Processed clauses : 7648
% 9.13/6.67 % ...of these trivial : 37
% 9.13/6.67 % ...subsumed : 5409
% 9.13/6.67 % ...remaining for further processing : 2202
% 9.13/6.67 % Other redundant clauses eliminated : 973
% 9.13/6.67 % Clauses deleted for lack of memory : 0
% 9.13/6.67 % Backward-subsumed : 153
% 9.13/6.67 % Backward-rewritten : 1414
% 9.13/6.67 % Generated clauses : 33983
% 9.13/6.67 % ...of the previous two non-redundant : 31222
% 9.13/6.67 % ...aggressively subsumed : 0
% 9.13/6.67 % Contextual simplify-reflections : 336
% 9.13/6.67 % Paramodulations : 32992
% 9.13/6.67 % Factorizations : 0
% 9.13/6.67 % NegExts : 0
% 9.13/6.67 % Equation resolutions : 991
% 9.13/6.67 % Disequality decompositions : 0
% 9.13/6.67 % Total rewrite steps : 36692
% 9.13/6.67 % ...of those cached : 36080
% 9.13/6.67 % Propositional unsat checks : 0
% 9.13/6.67 % Propositional check models : 0
% 9.13/6.67 % Propositional check unsatisfiable : 0
% 9.13/6.67 % Propositional clauses : 0
% 9.13/6.67 % Propositional clauses after purity: 0
% 9.13/6.67 % Propositional unsat core size : 0
% 9.13/6.67 % Propositional preprocessing time : 0.000
% 9.13/6.67 % Propositional encoding time : 0.000
% 9.13/6.67 % Propositional solver time : 0.000
% 9.13/6.67 % Success case prop preproc time : 0.000
% 9.13/6.67 % Success case prop encoding time : 0.000
% 9.13/6.67 % Success case prop solver time : 0.000
% 9.13/6.67 % Current number of processed clauses : 611
% 9.13/6.67 % Positive orientable unit clauses : 59
% 9.13/6.67 % Positive unorientable unit clauses: 0
% 9.13/6.67 % Negative unit clauses : 10
% 9.13/6.67 % Non-unit-clauses : 542
% 9.13/6.67 % Current number of unprocessed clauses: 22087
% 9.13/6.67 % ...number of literals in the above : 119699
% 9.13/6.67 % Current number of archived formulas : 0
% 9.13/6.67 % Current number of archived clauses : 1568
% 9.13/6.67 % Clause-clause subsumption calls (NU) : 661329
% 9.13/6.67 % Rec. Clause-clause subsumption calls : 176957
% 9.13/6.67 % Non-unit clause-clause subsumptions : 4382
% 9.13/6.67 % Unit Clause-clause subsumption calls : 1755
% 9.13/6.67 % Rewrite failures with RHS unbound : 0
% 9.13/6.67 % BW rewrite match attempts : 58
% 9.13/6.67 % BW rewrite match successes : 48
% 9.13/6.67 % Condensation attempts : 0
% 9.13/6.67 % Condensation successes : 0
% 9.13/6.67 % Termbank termtop insertions : 694526
% 9.13/6.67 % Search garbage collected termcells : 529
% 9.13/6.67
% 9.13/6.67 % -------------------------------------------------
% 9.13/6.67 % User time : 1.138 s
% 9.13/6.67 % System time : 0.032 s
% 9.13/6.67 % Total time : 1.170 s
% 9.13/6.67 % Maximum resident set size: 3764 pages
% 9.13/6.67
% 9.13/6.67 % -------------------------------------------------
% 9.13/6.67 % User time : 5.604 s
% 9.13/6.67 % System time : 0.227 s
% 9.13/6.67 % Total time : 5.831 s
% 9.13/6.67 % Maximum resident set size: 4864 pages
% 9.13/6.67 % E exiting
%------------------------------------------------------------------------------