%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC090-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 : n006.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:42:57 PM UTC 2026
% Result : Unsatisfiable 1.52s 0.72s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of clauses : 93 ( 34 unt; 3 nHn; 93 RR)
% Number of literals : 235 ( 79 equ; 146 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 : 92 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_11,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_12,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_10,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
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(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_25,negated_conjecture,
app(sk5,sk6) = sk4,
co1_11 ).
cnf(c_0_26,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_27,negated_conjecture,
app(sk6,sk5) = sk3,
co1_12 ).
cnf(c_0_28,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_32,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_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_23 ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_24 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk5),
co1_9 ).
cnf(c_0_38,negated_conjecture,
ssList(sk6),
co1_10 ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_41,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_29 ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_30 ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_31 ).
cnf(c_0_45,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_46,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_32 ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk6,X2)
| segmentP(app(sk2,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_39 ).
cnf(c_0_52,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_54,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_40 ).
cnf(c_0_55,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_56,negated_conjecture,
( sk6 != nil
| sk5 != nil
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_37]),c_0_38])]) ).
cnf(c_0_57,negated_conjecture,
( sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_38]),c_0_37])]) ).
cnf(c_0_58,negated_conjecture,
( sk2 != nil
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_38]),c_0_37])]) ).
cnf(c_0_59,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_45 ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(X1)
| app(sk6,app(sk5,X1)) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_41]),c_0_38]),c_0_37])]) ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_47 ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk6,X1)
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_41]),c_0_37]),c_0_38])]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_49 ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk6,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_35]),c_0_52])]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_53 ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk5,X2)
| segmentP(app(sk1,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_41]),c_0_38]),c_0_37])]) ).
cnf(c_0_67,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_68,negated_conjecture,
( ~ segmentP(sk2,sk2)
| ~ segmentP(sk1,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_52])]) ).
cnf(c_0_69,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(X1)
| app(sk6,X1) != sk1
| X1 = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_41]),c_0_37]),c_0_38])]) ).
cnf(c_0_71,negated_conjecture,
app(sk6,sk2) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_36]),c_0_38])]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_61]),c_0_35])]) ).
cnf(c_0_73,negated_conjecture,
segmentP(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_38])]) ).
cnf(c_0_74,negated_conjecture,
segmentP(sk2,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_63]),c_0_38])]) ).
cnf(c_0_75,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_46]),c_0_35])]),c_0_65]) ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_34]),c_0_35])]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk5,X1)
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_51]),c_0_35]),c_0_67])]) ).
cnf(c_0_78,negated_conjecture,
( ~ segmentP(sk2,sk2)
| ~ segmentP(nil,sk2)
| sk2 != nil ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_80,negated_conjecture,
( app(sk1,sk6) != sk1
| sk5 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_52])]) ).
cnf(c_0_81,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_38])]) ).
cnf(c_0_82,negated_conjecture,
app(sk1,nil) = sk1,
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_75,c_0_60]),c_0_41]),c_0_38]),c_0_37]),c_0_35])]) ).
cnf(c_0_83,negated_conjecture,
app(nil,sk2) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_84,negated_conjecture,
segmentP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_63]),c_0_37])]) ).
cnf(c_0_85,negated_conjecture,
( ~ segmentP(nil,sk2)
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_63]),c_0_52])]) ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_79 ).
cnf(c_0_87,negated_conjecture,
sk5 = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_82])]) ).
cnf(c_0_88,negated_conjecture,
sk1 = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_81]),c_0_83]),c_0_81]),c_0_82]) ).
cnf(c_0_89,negated_conjecture,
( ~ segmentP(sk2,sk5)
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_84]),c_0_37])]) ).
cnf(c_0_90,negated_conjecture,
sk2 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_52])]) ).
cnf(c_0_91,negated_conjecture,
segmentP(sk2,sk2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_87]),c_0_88]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_87]),c_0_87]),c_0_90]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC090-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.43 % Computer : n006.cluster.edu
% 0.19/0.43 % Model : x86_64 x86_64
% 0.19/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.43 % Memory : 8046.5625MB
% 0.19/0.43 % OS : Linux 6.8.0-71-generic
% 0.19/0.43 % CPULimit : 300
% 0.19/0.43 % WCLimit : 300
% 0.19/0.43 % DateTime : Mon Sep 21 07:54:27 UTC 2026
% 0.19/0.43 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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.52/0.72 % Version: 3.5.1
% 1.52/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.52/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.52/0.72 % Starting new_bool_3 with 300s (1) cores
% 1.52/0.72 % Starting new_bool_1 with 300s (1) cores
% 1.52/0.72 % Starting sh5l with 300s (1) cores
% 1.52/0.72 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2360441 completed with status 0
% 1.52/0.72 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.52/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.52/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.52/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.52/0.72 % No SInE strategy applied
% 1.52/0.72 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.52/0.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.52/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.52/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.52/0.72 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.52/0.72 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.52/0.72 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.52/0.72 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 2360449 completed with status 0
% 1.52/0.72 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1.52/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.52/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.52/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.52/0.72 % No SInE strategy applied
% 1.52/0.72 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.52/0.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.52/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.52/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.52/0.72 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.52/0.72 % Preprocessing time : 0.006 s
% 1.52/0.72 % Presaturation interreduction done
% 1.52/0.72
% 1.52/0.72 % Proof found!
% 1.52/0.72 % SZS status Unsatisfiable
% 1.52/0.72 % SZS output start CNFRefutation
% See solution above
% 1.52/0.72 % Parsed axioms : 197
% 1.52/0.72 % Removed by relevancy pruning/SinE : 0
% 1.52/0.72 % Initial clauses : 197
% 1.52/0.72 % Removed in clause preprocessing : 0
% 1.52/0.72 % Initial clauses in saturation : 197
% 1.52/0.72 % Processed clauses : 926
% 1.52/0.72 % ...of these trivial : 33
% 1.52/0.72 % ...subsumed : 246
% 1.52/0.72 % ...remaining for further processing : 646
% 1.52/0.72 % Other redundant clauses eliminated : 95
% 1.52/0.72 % Clauses deleted for lack of memory : 0
% 1.52/0.72 % Backward-subsumed : 19
% 1.52/0.72 % Backward-rewritten : 150
% 1.52/0.72 % Generated clauses : 3386
% 1.52/0.72 % ...of the previous two non-redundant : 3119
% 1.52/0.72 % ...aggressively subsumed : 0
% 1.52/0.72 % Contextual simplify-reflections : 28
% 1.52/0.72 % Paramodulations : 3262
% 1.52/0.72 % Factorizations : 0
% 1.52/0.72 % NegExts : 0
% 1.52/0.72 % Equation resolutions : 116
% 1.52/0.72 % Disequality decompositions : 0
% 1.52/0.72 % Total rewrite steps : 3167
% 1.52/0.72 % ...of those cached : 2990
% 1.52/0.72 % Propositional unsat checks : 0
% 1.52/0.72 % Propositional check models : 0
% 1.52/0.72 % Propositional check unsatisfiable : 0
% 1.52/0.72 % Propositional clauses : 0
% 1.52/0.72 % Propositional clauses after purity: 0
% 1.52/0.72 % Propositional unsat core size : 0
% 1.52/0.72 % Propositional preprocessing time : 0.000
% 1.52/0.72 % Propositional encoding time : 0.000
% 1.52/0.72 % Propositional solver time : 0.000
% 1.52/0.72 % Success case prop preproc time : 0.000
% 1.52/0.72 % Success case prop encoding time : 0.000
% 1.52/0.72 % Success case prop solver time : 0.000
% 1.52/0.72 % Current number of processed clauses : 276
% 1.52/0.72 % Positive orientable unit clauses : 69
% 1.52/0.72 % Positive unorientable unit clauses: 0
% 1.52/0.72 % Negative unit clauses : 11
% 1.52/0.72 % Non-unit-clauses : 196
% 1.52/0.72 % Current number of unprocessed clauses: 2539
% 1.52/0.72 % ...number of literals in the above : 15579
% 1.52/0.72 % Current number of archived formulas : 0
% 1.52/0.72 % Current number of archived clauses : 362
% 1.52/0.72 % Clause-clause subsumption calls (NU) : 26594
% 1.52/0.72 % Rec. Clause-clause subsumption calls : 7197
% 1.52/0.72 % Non-unit clause-clause subsumptions : 138
% 1.52/0.72 % Unit Clause-clause subsumption calls : 1967
% 1.52/0.72 % Rewrite failures with RHS unbound : 0
% 1.52/0.72 % BW rewrite match attempts : 4
% 1.52/0.72 % BW rewrite match successes : 4
% 1.52/0.72 % Condensation attempts : 0
% 1.52/0.72 % Condensation successes : 0
% 1.52/0.72 % Termbank termtop insertions : 66432
% 1.52/0.72 % Search garbage collected termcells : 536
% 1.52/0.72
% 1.52/0.72 % -------------------------------------------------
% 1.52/0.72 % User time : 0.181 s
% 1.52/0.72 % System time : 0.010 s
% 1.52/0.72 % Total time : 0.191 s
% 1.52/0.72 % Maximum resident set size: 4036 pages
% 1.52/0.72
% 1.52/0.72 % -------------------------------------------------
% 1.52/0.72 % User time : 0.831 s
% 1.52/0.72 % System time : 0.053 s
% 1.52/0.72 % Total time : 0.884 s
% 1.52/0.72 % Maximum resident set size: 5120 pages
% 1.52/0.72 % E exiting
%------------------------------------------------------------------------------