%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC108-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 : n009.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:02 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.50s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 23
% Syntax : Number of clauses : 85 ( 19 unt; 12 nHn; 73 RR)
% Number of literals : 238 ( 58 equ; 154 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 : 113 ( 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/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(co1_14,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause117,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause117) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(c_0_23,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_24,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_23 ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_27,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_24]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_25 ).
cnf(c_0_29,axiom,
ssList(nil),
clause8 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_26 ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_32,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_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_31 ).
cnf(c_0_34,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_32,c_0_33]),c_0_29])]),c_0_30]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_36,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_30]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_35 ).
cnf(c_0_38,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_41,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_36,c_0_37]),c_0_38]),c_0_29])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_39 ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_40 ).
cnf(c_0_44,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_45,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_46,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
co1_14 ).
cnf(c_0_47,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_48,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssList(cons(skaf44(X2),X2))
| ~ singletonP(X2)
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_44 ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_45 ).
cnf(c_0_53,negated_conjecture,
( rearsegP(sk2,sk1)
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_47]) ).
cnf(c_0_54,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_55,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ singletonP(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_30]),c_0_38])]) ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_30]),c_0_29])]) ).
cnf(c_0_58,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_59,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
co1_11 ).
cnf(c_0_60,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_51]) ).
cnf(c_0_61,negated_conjecture,
( sk1 = nil
| app(skaf46(sk2,sk1),sk1) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_62,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_65,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause117]) ).
cnf(c_0_66,plain,
( ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
c_0_58 ).
cnf(c_0_68,negated_conjecture,
( neq(sk1,nil)
| sk2 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_48]),c_0_47]) ).
cnf(c_0_69,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk2,X1))
| segmentP(app(sk2,X1),sk1)
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_54]),c_0_62])]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_63 ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_64 ).
cnf(c_0_72,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_65 ).
cnf(c_0_73,plain,
( ~ ssItem(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_30]),c_0_29])]) ).
cnf(c_0_74,negated_conjecture,
( ~ segmentP(sk2,sk1)
| sk2 = nil ),
inference(csr,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
( segmentP(sk2,sk1)
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_55]),c_0_29])]) ).
cnf(c_0_76,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_61]),c_0_54]),c_0_62])]) ).
cnf(c_0_77,plain,
( ~ ssItem(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_78,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_73,c_0_38]) ).
cnf(c_0_79,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_80,negated_conjecture,
sk1 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).
cnf(c_0_81,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_82,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_79 ).
cnf(c_0_83,negated_conjecture,
sk2 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_80]),c_0_81]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_80])]),c_0_83]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC108-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.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:55:58 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 0.40/0.50 % Version: 3.5.1
% 0.40/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.50 % Starting sh5l with 300s (1) cores
% 0.40/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1253634 completed with status 0
% 0.40/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.40/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.50 % No SInE strategy applied
% 0.40/0.50 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.40/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.40/0.50 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.40/0.50 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.40/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.40/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1253642 completed with status 0
% 0.40/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.40/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.50 % No SInE strategy applied
% 0.40/0.50 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.40/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.40/0.50 % Preprocessing time : 0.004 s
% 0.40/0.50 % Presaturation interreduction done
% 0.40/0.50
% 0.40/0.50 % Proof found!
% 0.40/0.50 % SZS status Unsatisfiable
% 0.40/0.50 % SZS output start CNFRefutation
% See solution above
% 0.40/0.50 % Parsed axioms : 199
% 0.40/0.50 % Removed by relevancy pruning/SinE : 0
% 0.40/0.50 % Initial clauses : 199
% 0.40/0.50 % Removed in clause preprocessing : 0
% 0.40/0.50 % Initial clauses in saturation : 199
% 0.40/0.50 % Processed clauses : 588
% 0.40/0.50 % ...of these trivial : 7
% 0.40/0.50 % ...subsumed : 60
% 0.40/0.50 % ...remaining for further processing : 520
% 0.40/0.50 % Other redundant clauses eliminated : 72
% 0.40/0.50 % Clauses deleted for lack of memory : 0
% 0.40/0.50 % Backward-subsumed : 11
% 0.40/0.50 % Backward-rewritten : 118
% 0.40/0.50 % Generated clauses : 903
% 0.40/0.50 % ...of the previous two non-redundant : 827
% 0.40/0.50 % ...aggressively subsumed : 0
% 0.40/0.50 % Contextual simplify-reflections : 10
% 0.40/0.50 % Paramodulations : 826
% 0.40/0.50 % Factorizations : 0
% 0.40/0.50 % NegExts : 0
% 0.40/0.50 % Equation resolutions : 78
% 0.40/0.50 % Disequality decompositions : 0
% 0.40/0.50 % Total rewrite steps : 1078
% 0.40/0.50 % ...of those cached : 965
% 0.40/0.50 % Propositional unsat checks : 0
% 0.40/0.50 % Propositional check models : 0
% 0.40/0.50 % Propositional check unsatisfiable : 0
% 0.40/0.50 % Propositional clauses : 0
% 0.40/0.50 % Propositional clauses after purity: 0
% 0.40/0.50 % Propositional unsat core size : 0
% 0.40/0.50 % Propositional preprocessing time : 0.000
% 0.40/0.50 % Propositional encoding time : 0.000
% 0.40/0.50 % Propositional solver time : 0.000
% 0.40/0.50 % Success case prop preproc time : 0.000
% 0.40/0.50 % Success case prop encoding time : 0.000
% 0.40/0.50 % Success case prop solver time : 0.000
% 0.40/0.50 % Current number of processed clauses : 177
% 0.40/0.50 % Positive orientable unit clauses : 57
% 0.40/0.50 % Positive unorientable unit clauses: 0
% 0.40/0.50 % Negative unit clauses : 5
% 0.40/0.50 % Non-unit-clauses : 115
% 0.40/0.50 % Current number of unprocessed clauses: 583
% 0.40/0.50 % ...number of literals in the above : 3397
% 0.40/0.50 % Current number of archived formulas : 0
% 0.40/0.50 % Current number of archived clauses : 320
% 0.40/0.50 % Clause-clause subsumption calls (NU) : 14605
% 0.40/0.50 % Rec. Clause-clause subsumption calls : 2531
% 0.40/0.50 % Non-unit clause-clause subsumptions : 67
% 0.40/0.50 % Unit Clause-clause subsumption calls : 220
% 0.40/0.50 % Rewrite failures with RHS unbound : 0
% 0.40/0.50 % BW rewrite match attempts : 36
% 0.40/0.50 % BW rewrite match successes : 27
% 0.40/0.50 % Condensation attempts : 0
% 0.40/0.50 % Condensation successes : 0
% 0.40/0.50 % Termbank termtop insertions : 27374
% 0.40/0.50 % Search garbage collected termcells : 538
% 0.40/0.50
% 0.40/0.50 % -------------------------------------------------
% 0.40/0.50 % User time : 0.057 s
% 0.40/0.50 % System time : 0.010 s
% 0.40/0.50 % Total time : 0.067 s
% 0.40/0.50 % Maximum resident set size: 3812 pages
% 0.40/0.50
% 0.40/0.50 % -------------------------------------------------
% 0.40/0.50 % User time : 0.270 s
% 0.40/0.50 % System time : 0.038 s
% 0.40/0.50 % Total time : 0.308 s
% 0.40/0.50 % Maximum resident set size: 5120 pages
% 0.40/0.50 % E exiting
%------------------------------------------------------------------------------