%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC173-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 : 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:45:15 PM UTC 2026
% Result : Unsatisfiable 0.14s 10.54s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 25
% Syntax : Number of clauses : 89 ( 34 unt; 10 nHn; 87 RR)
% Number of literals : 220 ( 64 equ; 129 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 94 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause143,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
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(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause65,axiom,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause65) ).
cnf(co1_23,negated_conjecture,
( nil = sk3
| cons(sk9,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_23) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| ssItem(sk9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause2,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause2) ).
cnf(c_0_25,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_26,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_27,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_29,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_30,negated_conjecture,
~ neq(sk5,sk6),
c_0_25 ).
cnf(c_0_31,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_33,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_34,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
c_0_27 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_28 ).
cnf(c_0_36,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_37,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_29 ).
cnf(c_0_38,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_39,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]),c_0_39]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_40 ).
cnf(c_0_44,axiom,
ssList(nil),
clause8 ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(app(app(sk7,cons(sk5,nil)),cons(sk5,nil)))
| rearsegP(sk1,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_36]),c_0_38]),c_0_39])]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_32]),c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| rearsegP(sk1,sk8) ),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_49,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_50,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_35]),c_0_47])]) ).
cnf(c_0_51,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_52,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| rearsegP(sk1,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_43]),c_0_32]),c_0_44])]) ).
cnf(c_0_53,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_49 ).
cnf(c_0_54,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_32]),c_0_44])]) ).
cnf(c_0_55,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_51 ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause65]) ).
cnf(c_0_57,negated_conjecture,
( nil = sk3
| cons(sk9,nil) = sk3 ),
co1_23 ).
cnf(c_0_58,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_59,negated_conjecture,
( nil = sk3
| ssItem(sk9) ),
co1_14 ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| rearsegP(sk1,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_35]),c_0_47])]) ).
cnf(c_0_62,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_53]) ).
cnf(c_0_63,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,app(nil,sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_32]),c_0_38]),c_0_44])]) ).
cnf(c_0_64,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_65,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
c_0_56 ).
cnf(c_0_66,negated_conjecture,
( nil = sk1
| cons(sk9,nil) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_58]) ).
cnf(c_0_67,negated_conjecture,
( ssItem(sk9)
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_59,c_0_58]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_60 ).
cnf(c_0_70,negated_conjecture,
rearsegP(sk1,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_43]),c_0_32]),c_0_44])]) ).
cnf(c_0_71,negated_conjecture,
( ~ duplicatefreeP(sk1)
| ~ ssList(app(nil,sk8)) ),
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_62,c_0_63]),c_0_32]),c_0_64]),c_0_44]),c_0_47])]) ).
cnf(c_0_72,negated_conjecture,
( duplicatefreeP(sk1)
| nil = sk1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_68 ).
cnf(c_0_76,negated_conjecture,
app(skaf46(sk1,sk8),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_38]),c_0_64])]) ).
cnf(c_0_77,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(app(nil,sk8))
| nil = sk1 ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_73 ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_74 ).
cnf(c_0_81,negated_conjecture,
( nil != sk1
| sk8 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_38]),c_0_77])]) ).
cnf(c_0_82,negated_conjecture,
nil = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_38])]) ).
cnf(c_0_83,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_80])]),c_0_44])]) ).
cnf(c_0_84,axiom,
duplicatefreeP(nil),
clause2 ).
cnf(c_0_85,negated_conjecture,
sk8 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_82])]) ).
cnf(c_0_86,plain,
app(sk1,sk1) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_82]),c_0_82]),c_0_82]) ).
cnf(c_0_87,plain,
duplicatefreeP(sk1),
inference(rw,[status(thm)],[c_0_84,c_0_82]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_82]),c_0_85]),c_0_86]),c_0_64]),c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC173-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.10/10.38 % Computer : n006.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Mon Sep 21 08:00:53 UTC 2026
% 0.10/10.39 % CPUTime :
% 0.10/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.43 Running first-order theorem proving
% 0.14/10.43 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
% 0.14/10.54 % Version: 3.5.1
% 0.14/10.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.54 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.54 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.54 % Starting sh5l with 300s (1) cores
% 0.14/10.54 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2373630 completed with status 0
% 0.14/10.54 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/10.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.54 % No SInE strategy applied
% 0.14/10.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/10.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.54 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/10.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/10.54 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/10.54 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/10.54 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2373639 completed with status 0
% 0.14/10.54 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.14/10.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.54 % No SInE strategy applied
% 0.14/10.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/10.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.54 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/10.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/10.54 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/10.54 % Preprocessing time : 0.004 s
% 0.14/10.54
% 0.14/10.54 % Proof found!
% 0.14/10.54 % SZS status Unsatisfiable
% 0.14/10.54 % SZS output start CNFRefutation
% See solution above
% 0.14/10.54 % Parsed axioms : 211
% 0.14/10.54 % Removed by relevancy pruning/SinE : 0
% 0.14/10.54 % Initial clauses : 211
% 0.14/10.54 % Removed in clause preprocessing : 0
% 0.14/10.54 % Initial clauses in saturation : 211
% 0.14/10.54 % Processed clauses : 699
% 0.14/10.54 % ...of these trivial : 15
% 0.14/10.54 % ...subsumed : 136
% 0.14/10.54 % ...remaining for further processing : 548
% 0.14/10.54 % Other redundant clauses eliminated : 68
% 0.14/10.54 % Clauses deleted for lack of memory : 0
% 0.14/10.54 % Backward-subsumed : 24
% 0.14/10.54 % Backward-rewritten : 285
% 0.14/10.54 % Generated clauses : 2095
% 0.14/10.54 % ...of the previous two non-redundant : 2030
% 0.14/10.54 % ...aggressively subsumed : 0
% 0.14/10.54 % Contextual simplify-reflections : 82
% 0.14/10.54 % Paramodulations : 2021
% 0.14/10.54 % Factorizations : 2
% 0.14/10.54 % NegExts : 0
% 0.14/10.54 % Equation resolutions : 73
% 0.14/10.54 % Disequality decompositions : 0
% 0.14/10.54 % Total rewrite steps : 2686
% 0.14/10.54 % ...of those cached : 2565
% 0.14/10.54 % Propositional unsat checks : 0
% 0.14/10.54 % Propositional check models : 0
% 0.14/10.54 % Propositional check unsatisfiable : 0
% 0.14/10.54 % Propositional clauses : 0
% 0.14/10.54 % Propositional clauses after purity: 0
% 0.14/10.54 % Propositional unsat core size : 0
% 0.14/10.54 % Propositional preprocessing time : 0.000
% 0.14/10.54 % Propositional encoding time : 0.000
% 0.14/10.54 % Propositional solver time : 0.000
% 0.14/10.54 % Success case prop preproc time : 0.000
% 0.14/10.54 % Success case prop encoding time : 0.000
% 0.14/10.54 % Success case prop solver time : 0.000
% 0.14/10.54 % Current number of processed clauses : 216
% 0.14/10.54 % Positive orientable unit clauses : 72
% 0.14/10.54 % Positive unorientable unit clauses: 0
% 0.14/10.54 % Negative unit clauses : 3
% 0.14/10.54 % Non-unit-clauses : 141
% 0.14/10.54 % Current number of unprocessed clauses: 1528
% 0.14/10.54 % ...number of literals in the above : 7197
% 0.14/10.54 % Current number of archived formulas : 0
% 0.14/10.54 % Current number of archived clauses : 309
% 0.14/10.54 % Clause-clause subsumption calls (NU) : 16445
% 0.14/10.54 % Rec. Clause-clause subsumption calls : 7664
% 0.14/10.54 % Non-unit clause-clause subsumptions : 234
% 0.14/10.54 % Unit Clause-clause subsumption calls : 857
% 0.14/10.54 % Rewrite failures with RHS unbound : 0
% 0.14/10.54 % BW rewrite match attempts : 44
% 0.14/10.54 % BW rewrite match successes : 27
% 0.14/10.54 % Condensation attempts : 0
% 0.14/10.54 % Condensation successes : 0
% 0.14/10.54 % Termbank termtop insertions : 48433
% 0.14/10.54 % Search garbage collected termcells : 547
% 0.14/10.54
% 0.14/10.54 % -------------------------------------------------
% 0.14/10.54 % User time : 0.078 s
% 0.14/10.54 % System time : 0.014 s
% 0.14/10.54 % Total time : 0.092 s
% 0.14/10.54 % Maximum resident set size: 4076 pages
% 0.14/10.54
% 0.14/10.54 % -------------------------------------------------
% 0.14/10.54 % User time : 0.411 s
% 0.14/10.54 % System time : 0.043 s
% 0.14/10.54 % Total time : 0.454 s
% 0.14/10.54 % Maximum resident set size: 5120 pages
% 0.14/10.54 % E exiting
%------------------------------------------------------------------------------