%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC115-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:43:04 PM UTC 2026
% Result : Unsatisfiable 58.88s 9.06s
% Output : CNFRefutation 58.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 25
% Syntax : Number of clauses : 88 ( 24 unt; 19 nHn; 77 RR)
% Number of literals : 230 ( 60 equ; 141 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 : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 114 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_7,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_10,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
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(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_16,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
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_14,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_26,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_10 ).
cnf(c_0_29,axiom,
ssList(nil),
clause8 ).
cnf(c_0_30,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_8 ).
cnf(c_0_31,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_33,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_34,negated_conjecture,
( sk3 != nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_36,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_13 ).
cnf(c_0_37,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_39,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_40,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_35 ).
cnf(c_0_44,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_47,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_39 ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_40 ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_41 ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_42 ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(X1)
| app(sk3,X1) = cons(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_53,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_46,c_0_32]) ).
cnf(c_0_54,plain,
( ~ duplicatefreeP(X4)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X1)
| app(cons(X1,X2),cons(X1,X3)) != X4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_29])]),c_0_49]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_50 ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(X1)
| ssList(cons(sk5,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_57,negated_conjecture,
( ~ duplicatefreeP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(cons(sk5,X1),sk3) != X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_45]),c_0_29])]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(X2)
| duplicatefreeP(cons(sk5,X2))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_60,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_61,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_62,negated_conjecture,
( ~ duplicatefreeP(X1)
| ~ ssList(X1)
| cons(sk5,sk3) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_43]),c_0_29]),c_0_45]),c_0_53])]) ).
cnf(c_0_63,negated_conjecture,
( duplicatefreeP(cons(sk5,sk3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_53]) ).
cnf(c_0_64,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_59 ).
cnf(c_0_66,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_60 ).
cnf(c_0_67,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_61 ).
cnf(c_0_68,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_69,negated_conjecture,
( ~ ssList(cons(sk5,sk3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_64 ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(X1)
| neq(sk3,X1)
| X1 = sk3 ),
inference(spm,[status(thm)],[c_0_65,c_0_53]) ).
cnf(c_0_72,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X1)
| app(X3,app(X2,X4)) != X1
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_68 ).
cnf(c_0_74,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_49]),c_0_45]),c_0_53])]) ).
cnf(c_0_75,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_33]),c_0_32]),c_0_32]) ).
cnf(c_0_76,negated_conjecture,
neq(sk3,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_29]),c_0_37]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,cons(sk5,X3)) != X1
| segmentP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_52]),c_0_53])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_79,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_80,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_81,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
co1_14 ).
cnf(c_0_82,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_83,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_84,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| segmentP(X1,sk3) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80])])]) ).
cnf(c_0_85,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_81,c_0_37]) ).
cnf(c_0_86,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_82,c_0_33]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC115-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 07:52:13 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 58.88/9.06 % Version: 3.5.1
% 58.88/9.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 58.88/9.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 58.88/9.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 58.88/9.06 % Starting new_bool_3 with 300s (1) cores
% 58.88/9.06 % Starting new_bool_1 with 300s (1) cores
% 58.88/9.06 % Starting sh5l with 300s (1) cores
% 58.88/9.06 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1829251 completed with status 0
% 58.88/9.06 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 58.88/9.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 58.88/9.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 58.88/9.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 58.88/9.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 58.88/9.06 % No SInE strategy applied
% 58.88/9.06 % Search class: FGHSM-FSLM21-MFFFFFNN
% 58.88/9.06 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 58.88/9.06 % Starting SubtermCWHack with 136s (1) cores
% 58.88/9.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 58.88/9.06 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 58.88/9.06 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 58.88/9.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 58.88/9.06 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1829261 completed with status 0
% 58.88/9.06 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 58.88/9.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 58.88/9.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 58.88/9.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 58.88/9.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 58.88/9.06 % No SInE strategy applied
% 58.88/9.06 % Search class: FGHSM-FSLM21-MFFFFFNN
% 58.88/9.06 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 58.88/9.06 % Starting SubtermCWHack with 136s (1) cores
% 58.88/9.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 58.88/9.06 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 58.88/9.06 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 58.88/9.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 58.88/9.06 % Preprocessing time : 0.005 s
% 58.88/9.06
% 58.88/9.06 % Proof found!
% 58.88/9.06 % SZS status Unsatisfiable
% 58.88/9.06 % SZS output start CNFRefutation
% See solution above
% 58.88/9.06 % Parsed axioms : 201
% 58.88/9.06 % Removed by relevancy pruning/SinE : 0
% 58.88/9.06 % Initial clauses : 201
% 58.88/9.06 % Removed in clause preprocessing : 0
% 58.88/9.06 % Initial clauses in saturation : 201
% 58.88/9.06 % Processed clauses : 10798
% 58.88/9.06 % ...of these trivial : 274
% 58.88/9.06 % ...subsumed : 6333
% 58.88/9.06 % ...remaining for further processing : 4191
% 58.88/9.06 % Other redundant clauses eliminated : 360
% 58.88/9.06 % Clauses deleted for lack of memory : 0
% 58.88/9.06 % Backward-subsumed : 468
% 58.88/9.06 % Backward-rewritten : 275
% 58.88/9.06 % Generated clauses : 270672
% 58.88/9.06 % ...of the previous two non-redundant : 259886
% 58.88/9.06 % ...aggressively subsumed : 0
% 58.88/9.06 % Contextual simplify-reflections : 615
% 58.88/9.06 % Paramodulations : 269647
% 58.88/9.06 % Factorizations : 345
% 58.88/9.06 % NegExts : 0
% 58.88/9.06 % Equation resolutions : 646
% 58.88/9.06 % Disequality decompositions : 0
% 58.88/9.06 % Total rewrite steps : 113944
% 58.88/9.06 % ...of those cached : 110564
% 58.88/9.06 % Propositional unsat checks : 0
% 58.88/9.06 % Propositional check models : 0
% 58.88/9.06 % Propositional check unsatisfiable : 0
% 58.88/9.06 % Propositional clauses : 0
% 58.88/9.06 % Propositional clauses after purity: 0
% 58.88/9.06 % Propositional unsat core size : 0
% 58.88/9.06 % Propositional preprocessing time : 0.000
% 58.88/9.06 % Propositional encoding time : 0.000
% 58.88/9.06 % Propositional solver time : 0.000
% 58.88/9.06 % Success case prop preproc time : 0.000
% 58.88/9.06 % Success case prop encoding time : 0.000
% 58.88/9.06 % Success case prop solver time : 0.000
% 58.88/9.06 % Current number of processed clauses : 3409
% 58.88/9.06 % Positive orientable unit clauses : 192
% 58.88/9.06 % Positive unorientable unit clauses: 0
% 58.88/9.06 % Negative unit clauses : 77
% 58.88/9.06 % Non-unit-clauses : 3140
% 58.88/9.06 % Current number of unprocessed clauses: 237231
% 58.88/9.06 % ...number of literals in the above : 1356004
% 58.88/9.06 % Current number of archived formulas : 0
% 58.88/9.06 % Current number of archived clauses : 777
% 58.88/9.06 % Clause-clause subsumption calls (NU) : 1665320
% 58.88/9.06 % Rec. Clause-clause subsumption calls : 449256
% 58.88/9.06 % Non-unit clause-clause subsumptions : 4451
% 58.88/9.06 % Unit Clause-clause subsumption calls : 22233
% 58.88/9.06 % Rewrite failures with RHS unbound : 0
% 58.88/9.06 % BW rewrite match attempts : 106
% 58.88/9.06 % BW rewrite match successes : 89
% 58.88/9.06 % Condensation attempts : 0
% 58.88/9.06 % Condensation successes : 0
% 58.88/9.06 % Termbank termtop insertions : 7483187
% 58.88/9.06 % Search garbage collected termcells : 547
% 58.88/9.06
% 58.88/9.06 % -------------------------------------------------
% 58.88/9.06 % User time : 7.744 s
% 58.88/9.06 % System time : 0.282 s
% 58.88/9.06 % Total time : 8.025 s
% 58.88/9.06 % Maximum resident set size: 4068 pages
% 58.88/9.06
% 58.88/9.06 % -------------------------------------------------
% 58.88/9.06 % User time : 40.061 s
% 58.88/9.06 % System time : 1.515 s
% 58.88/9.06 % Total time : 41.577 s
% 58.88/9.06 % Maximum resident set size: 5120 pages
% 58.88/9.06 % E exiting
%------------------------------------------------------------------------------