%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC058-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 : n003.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:44 PM UTC 2026
% Result : Unsatisfiable 1.04s 0.67s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 24
% Syntax : Number of clauses : 92 ( 20 unt; 12 nHn; 80 RR)
% Number of literals : 261 ( 61 equ; 170 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 120 ( 15 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/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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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(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_14,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_11,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause117,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause117) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(c_0_24,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_25,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_24 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_28,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_25]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_26 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_27 ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_33,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_28,c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_32 ).
cnf(c_0_35,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(cons(X1,cons(X1,X2)))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30])]),c_0_31]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_37,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_31]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_36 ).
cnf(c_0_39,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_42,plain,
( ~ duplicatefreeP(cons(skaf44(X1),X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_30])]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_40 ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_46,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_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_48,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
co1_14 ).
cnf(c_0_49,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_50,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_51,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssList(cons(skaf44(X2),X2))
| ~ singletonP(X2)
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_54,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
c_0_45 ).
cnf(c_0_55,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
co1_11 ).
cnf(c_0_56,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_46 ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_47 ).
cnf(c_0_58,negated_conjecture,
( rearsegP(sk2,sk3)
| sk3 = nil ),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ singletonP(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_31]),c_0_39])]) ).
cnf(c_0_62,plain,
( ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_31]),c_0_30])]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil)
| sk2 = nil ),
inference(rw,[status(thm)],[c_0_54,c_0_51]) ).
cnf(c_0_64,negated_conjecture,
( neq(sk3,nil)
| sk2 = nil ),
inference(rw,[status(thm)],[c_0_55,c_0_49]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_67,negated_conjecture,
( sk3 = nil
| app(skaf46(sk2,sk3),sk3) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60])]) ).
cnf(c_0_68,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_71,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause117]) ).
cnf(c_0_72,plain,
( ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_73,negated_conjecture,
( ~ segmentP(sk2,sk3)
| ~ segmentP(sk3,sk3)
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_59])]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_65 ).
cnf(c_0_75,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk2,X1))
| segmentP(app(sk2,X1),sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_59]),c_0_68])]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_69 ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_70 ).
cnf(c_0_78,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_71 ).
cnf(c_0_79,plain,
( ~ ssItem(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_31]),c_0_30])]) ).
cnf(c_0_80,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_81,negated_conjecture,
( ~ segmentP(sk2,sk3)
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_59])]) ).
cnf(c_0_82,negated_conjecture,
( segmentP(sk2,sk3)
| sk3 = 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_60]),c_0_30])]) ).
cnf(c_0_83,negated_conjecture,
( sk2 != nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_67]),c_0_59]),c_0_68])]) ).
cnf(c_0_84,plain,
( ~ ssItem(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_78]) ).
cnf(c_0_85,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_79,c_0_39]) ).
cnf(c_0_86,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_80 ).
cnf(c_0_87,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]) ).
cnf(c_0_88,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_89,negated_conjecture,
( sk3 != nil
| neq(sk2,nil) ),
inference(rw,[status(thm)],[c_0_86,c_0_51]) ).
cnf(c_0_90,negated_conjecture,
sk2 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_87]),c_0_88]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_87])]),c_0_90]),c_0_88]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC058-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n003.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 07:53:45 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.51 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
% 1.04/0.67 % Version: 3.5.1
% 1.04/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.04/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.04/0.67 % Starting new_bool_3 with 300s (1) cores
% 1.04/0.67 % Starting new_bool_1 with 300s (1) cores
% 1.04/0.67 % Starting sh5l with 300s (1) cores
% 1.04/0.67 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3793697 completed with status 0
% 1.04/0.67 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.04/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.04/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.04/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.04/0.67 % No SInE strategy applied
% 1.04/0.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.04/0.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.04/0.67 % Starting SubtermCWHack with 136s (1) cores
% 1.04/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.04/0.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.04/0.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.04/0.67 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.04/0.67 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3793703 completed with status 0
% 1.04/0.67 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.04/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.04/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.04/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.04/0.67 % No SInE strategy applied
% 1.04/0.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.04/0.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.04/0.67 % Starting SubtermCWHack with 136s (1) cores
% 1.04/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.04/0.67 % Preprocessing time : 0.005 s
% 1.04/0.67 % Presaturation interreduction done
% 1.04/0.67
% 1.04/0.67 % Proof found!
% 1.04/0.67 % SZS status Unsatisfiable
% 1.04/0.67 % SZS output start CNFRefutation
% See solution above
% 1.04/0.67 % Parsed axioms : 199
% 1.04/0.67 % Removed by relevancy pruning/SinE : 0
% 1.04/0.67 % Initial clauses : 199
% 1.04/0.67 % Removed in clause preprocessing : 0
% 1.04/0.67 % Initial clauses in saturation : 199
% 1.04/0.67 % Processed clauses : 599
% 1.04/0.67 % ...of these trivial : 4
% 1.04/0.67 % ...subsumed : 65
% 1.04/0.67 % ...remaining for further processing : 529
% 1.04/0.67 % Other redundant clauses eliminated : 68
% 1.04/0.67 % Clauses deleted for lack of memory : 0
% 1.04/0.67 % Backward-subsumed : 12
% 1.04/0.67 % Backward-rewritten : 121
% 1.04/0.67 % Generated clauses : 906
% 1.04/0.67 % ...of the previous two non-redundant : 839
% 1.04/0.67 % ...aggressively subsumed : 0
% 1.04/0.67 % Contextual simplify-reflections : 9
% 1.04/0.67 % Paramodulations : 833
% 1.04/0.67 % Factorizations : 0
% 1.04/0.67 % NegExts : 0
% 1.04/0.67 % Equation resolutions : 74
% 1.04/0.67 % Disequality decompositions : 0
% 1.04/0.67 % Total rewrite steps : 1049
% 1.04/0.67 % ...of those cached : 938
% 1.04/0.67 % Propositional unsat checks : 0
% 1.04/0.67 % Propositional check models : 0
% 1.04/0.67 % Propositional check unsatisfiable : 0
% 1.04/0.67 % Propositional clauses : 0
% 1.04/0.67 % Propositional clauses after purity: 0
% 1.04/0.67 % Propositional unsat core size : 0
% 1.04/0.67 % Propositional preprocessing time : 0.000
% 1.04/0.67 % Propositional encoding time : 0.000
% 1.04/0.67 % Propositional solver time : 0.000
% 1.04/0.67 % Success case prop preproc time : 0.000
% 1.04/0.67 % Success case prop encoding time : 0.000
% 1.04/0.67 % Success case prop solver time : 0.000
% 1.04/0.67 % Current number of processed clauses : 182
% 1.04/0.67 % Positive orientable unit clauses : 57
% 1.04/0.67 % Positive unorientable unit clauses: 0
% 1.04/0.67 % Negative unit clauses : 5
% 1.04/0.67 % Non-unit-clauses : 120
% 1.04/0.67 % Current number of unprocessed clauses: 581
% 1.04/0.67 % ...number of literals in the above : 3407
% 1.04/0.67 % Current number of archived formulas : 0
% 1.04/0.67 % Current number of archived clauses : 324
% 1.04/0.67 % Clause-clause subsumption calls (NU) : 14815
% 1.04/0.67 % Rec. Clause-clause subsumption calls : 2585
% 1.04/0.67 % Non-unit clause-clause subsumptions : 70
% 1.04/0.67 % Unit Clause-clause subsumption calls : 197
% 1.04/0.67 % Rewrite failures with RHS unbound : 0
% 1.04/0.67 % BW rewrite match attempts : 36
% 1.04/0.67 % BW rewrite match successes : 27
% 1.04/0.67 % Condensation attempts : 0
% 1.04/0.67 % Condensation successes : 0
% 1.04/0.67 % Termbank termtop insertions : 27609
% 1.04/0.67 % Search garbage collected termcells : 544
% 1.04/0.67
% 1.04/0.67 % -------------------------------------------------
% 1.04/0.67 % User time : 0.093 s
% 1.04/0.67 % System time : 0.009 s
% 1.04/0.67 % Total time : 0.103 s
% 1.04/0.67 % Maximum resident set size: 4068 pages
% 1.04/0.67
% 1.04/0.67 % -------------------------------------------------
% 1.04/0.67 % User time : 0.399 s
% 1.04/0.67 % System time : 0.043 s
% 1.04/0.67 % Total time : 0.443 s
% 1.04/0.67 % Maximum resident set size: 5120 pages
% 1.04/0.67 % E exiting
%------------------------------------------------------------------------------