%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW442-1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 03:10:42 PM UTC 2026
% Result : Unsatisfiable 3.61s 1.08s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of clauses : 46 ( 28 unt; 18 nHn; 40 RR)
% Number of literals : 73 ( 53 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 20 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 17 con; 0-2 aty)
% Number of variables : 66 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).
cnf(premise_29,hypothesis,
heap(sep(lseg(x5,x14),sep(lseg(x13,x15),sep(lseg(x13,x12),sep(lseg(x13,x2),sep(lseg(x10,x11),sep(lseg(x18,x10),sep(lseg(x18,x11),sep(lseg(x1,x5),sep(lseg(x4,x15),sep(lseg(x4,x11),sep(lseg(x15,x16),sep(lseg(x17,x10),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x9,x15),sep(lseg(x7,x12),sep(lseg(x7,x13),sep(lseg(x11,x9),emp))))))))))))))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_29) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(premise_14,hypothesis,
x2 != x6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_14) ).
cnf(premise_1,hypothesis,
x6 != x13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_1) ).
cnf(premise_21,hypothesis,
x4 != x11,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_21) ).
cnf(premise_23,hypothesis,
x4 != x13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_23) ).
cnf(c_0_8,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[wellformedness_5]) ).
cnf(c_0_9,hypothesis,
heap(sep(lseg(x5,x14),sep(lseg(x13,x15),sep(lseg(x13,x12),sep(lseg(x13,x2),sep(lseg(x10,x11),sep(lseg(x18,x10),sep(lseg(x18,x11),sep(lseg(x1,x5),sep(lseg(x4,x15),sep(lseg(x4,x11),sep(lseg(x15,x16),sep(lseg(x17,x10),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x9,x15),sep(lseg(x7,x12),sep(lseg(x7,x13),sep(lseg(x11,x9),emp))))))))))))))))))),
premise_29 ).
cnf(c_0_10,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_11,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
c_0_8 ).
cnf(c_0_12,hypothesis,
heap(sep(lseg(x13,x2),sep(lseg(x13,x15),sep(lseg(x13,x12),sep(lseg(x11,x9),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x15,x16),sep(lseg(x10,x11),sep(lseg(x4,x11),sep(lseg(x4,x15),sep(lseg(x17,x10),sep(lseg(x9,x15),sep(lseg(x7,x13),sep(lseg(x7,x12),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp))))))))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_13,hypothesis,
( x2 = x13
| x15 = x13 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_15,hypothesis,
( heap(sep(lseg(x13,x2),sep(lseg(x13,x12),sep(lseg(x13,x16),sep(lseg(x11,x9),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x10,x11),sep(lseg(x4,x13),sep(lseg(x4,x11),sep(lseg(x17,x10),sep(lseg(x9,x13),sep(lseg(x7,x13),sep(lseg(x7,x12),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp))))))))))))))))))
| x2 = x13 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_16,hypothesis,
( x2 = x13
| x12 = x13 ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_17,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_18,hypothesis,
( heap(sep(lseg(x13,x2),sep(lseg(x13,x16),sep(lseg(x11,x9),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x10,x11),sep(lseg(x4,x13),sep(lseg(x4,x11),sep(lseg(x17,x10),sep(lseg(x9,x13),sep(lseg(x7,x13),sep(lseg(x7,x13),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp)))))))))))))))))
| x2 = x13 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_19,plain,
( ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_20,hypothesis,
( x2 = x13
| x16 = x13 ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_21,hypothesis,
x2 != x6,
inference(fof_simplification,[status(thm)],[premise_14]) ).
cnf(c_0_22,hypothesis,
( x12 = x13
| x15 = x13 ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_23,plain,
( ~ heap(sep(X4,sep(X5,sep(lseg(X1,X2),sep(lseg(X1,X3),X6)))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,hypothesis,
( heap(sep(lseg(x13,x2),sep(lseg(x11,x9),sep(lseg(x2,x13),sep(lseg(x2,x6),sep(lseg(x10,x11),sep(lseg(x4,x13),sep(lseg(x4,x11),sep(lseg(x17,x10),sep(lseg(x9,x13),sep(lseg(x7,x13),sep(lseg(x7,x13),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp))))))))))))))))
| x2 = x13 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_14]) ).
cnf(c_0_25,hypothesis,
x2 != x6,
c_0_21 ).
cnf(c_0_26,hypothesis,
( heap(sep(lseg(x13,x2),sep(lseg(x13,x15),sep(lseg(x11,x9),sep(lseg(x2,x16),sep(lseg(x2,x6),sep(lseg(x15,x16),sep(lseg(x10,x11),sep(lseg(x4,x11),sep(lseg(x4,x15),sep(lseg(x17,x10),sep(lseg(x9,x15),sep(lseg(x7,x13),sep(lseg(x7,x13),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp))))))))))))))))))
| x15 = x13 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22]),c_0_14]) ).
cnf(c_0_27,hypothesis,
x2 = x13,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,hypothesis,
x6 != x13,
inference(fof_simplification,[status(thm)],[premise_1]) ).
cnf(c_0_29,plain,
( ~ heap(sep(lseg(X1,X3),sep(X4,sep(lseg(X1,X2),X5))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_30,hypothesis,
( heap(sep(lseg(x13,x15),sep(lseg(x13,x16),sep(lseg(x13,x6),sep(lseg(x11,x9),sep(lseg(x15,x16),sep(lseg(x10,x11),sep(lseg(x4,x11),sep(lseg(x4,x15),sep(lseg(x17,x10),sep(lseg(x9,x15),sep(lseg(x7,x13),sep(lseg(x7,x13),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp)))))))))))))))))
| x15 = x13 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_10]),c_0_10]),c_0_14]) ).
cnf(c_0_31,hypothesis,
x6 != x13,
c_0_28 ).
cnf(c_0_32,hypothesis,
x15 = x13,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_33,plain,
( ~ heap(sep(lseg(X1,X3),sep(X4,sep(X5,sep(lseg(X1,X2),X6)))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_34,hypothesis,
heap(sep(lseg(x13,x12),sep(lseg(x13,x16),sep(lseg(x13,x16),sep(lseg(x13,x6),sep(lseg(x11,x9),sep(lseg(x10,x11),sep(lseg(x4,x13),sep(lseg(x4,x11),sep(lseg(x17,x10),sep(lseg(x9,x13),sep(lseg(x7,x13),sep(lseg(x7,x12),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp))))))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_32]),c_0_27]),c_0_14]),c_0_27]),c_0_27]),c_0_10]),c_0_14]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_35,plain,
( ~ heap(sep(X4,sep(lseg(X1,X2),sep(X5,sep(lseg(X1,X3),X6)))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_36,plain,
sep(X1,sep(X2,sep(X3,sep(X4,X5)))) = sep(X3,sep(X2,sep(X4,sep(X1,X5)))),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_37,hypothesis,
x12 = x13,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31]) ).
cnf(c_0_38,hypothesis,
x16 = x13,
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_39,hypothesis,
x4 != x11,
inference(fof_simplification,[status(thm)],[premise_21]) ).
cnf(c_0_40,hypothesis,
x4 != x13,
inference(fof_simplification,[status(thm)],[premise_23]) ).
cnf(c_0_41,plain,
( ~ heap(sep(X4,sep(X5,sep(X6,sep(lseg(X1,X3),sep(lseg(X1,X2),X7))))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,hypothesis,
heap(sep(lseg(x13,x6),sep(lseg(x11,x9),sep(lseg(x10,x11),sep(lseg(x4,x13),sep(lseg(x4,x11),sep(lseg(x17,x10),sep(lseg(x9,x13),sep(lseg(x7,x13),sep(lseg(x7,x13),sep(lseg(x5,x14),sep(lseg(x18,x11),sep(lseg(x18,x10),sep(lseg(x1,x5),emp)))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_37]),c_0_27]),c_0_32]),c_0_14]),c_0_27]),c_0_38]),c_0_27]),c_0_32]),c_0_38]),c_0_32]),c_0_32]),c_0_10]),c_0_14]),c_0_14]),c_0_10]),c_0_14]),c_0_14]) ).
cnf(c_0_43,hypothesis,
x4 != x11,
c_0_39 ).
cnf(c_0_44,hypothesis,
x4 != x13,
c_0_40 ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW442-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 09:53:26 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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
% 3.61/1.08 % Version: 3.5.1
% 3.61/1.08 % Preprocessing class: FSMSSMSMSSSNFFN.
% 3.61/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.61/1.08 % Starting new_bool_3 with 300s (1) cores
% 3.61/1.08 % Starting new_bool_1 with 300s (1) cores
% 3.61/1.08 % Starting sh5l with 300s (1) cores
% 3.61/1.08 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1606908 completed with status 0
% 3.61/1.08 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 3.61/1.08 % Preprocessing class: FSMSSMSMSSSNFFN.
% 3.61/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.61/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.61/1.08 % No SInE strategy applied
% 3.61/1.08 % Search class: FGUSS-FFMF22-DFFFFFNN
% 3.61/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.61/1.08 % Starting SubtermCWHack with 136s (1) cores
% 3.61/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 3.61/1.08 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 3.61/1.08 % Starting new_bool_3 with 298s (1) cores
% 3.61/1.08 % Starting new_bool_1 with 291s (1) cores
% 3.61/1.08 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1606916 completed with status 0
% 3.61/1.08 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 3.61/1.08 % Preprocessing class: FSMSSMSMSSSNFFN.
% 3.61/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.61/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.61/1.08 % No SInE strategy applied
% 3.61/1.08 % Search class: FGUSS-FFMF22-DFFFFFNN
% 3.61/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.61/1.08 % Starting SubtermCWHack with 136s (1) cores
% 3.61/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 3.61/1.08 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 3.61/1.08 % Preprocessing time : 0.001 s
% 3.61/1.08
% 3.61/1.08 % Proof found!
% 3.61/1.08 % SZS status Unsatisfiable
% 3.61/1.08 % SZS output start CNFRefutation
% See solution above
% 3.61/1.08 % Parsed axioms : 41
% 3.61/1.08 % Removed by relevancy pruning/SinE : 0
% 3.61/1.08 % Initial clauses : 41
% 3.61/1.08 % Removed in clause preprocessing : 1
% 3.61/1.08 % Initial clauses in saturation : 40
% 3.61/1.08 % Processed clauses : 2702
% 3.61/1.08 % ...of these trivial : 7
% 3.61/1.08 % ...subsumed : 2399
% 3.61/1.08 % ...remaining for further processing : 296
% 3.61/1.08 % Other redundant clauses eliminated : 22
% 3.61/1.08 % Clauses deleted for lack of memory : 0
% 3.61/1.08 % Backward-subsumed : 1
% 3.61/1.08 % Backward-rewritten : 29
% 3.61/1.08 % Generated clauses : 34781
% 3.61/1.08 % ...of the previous two non-redundant : 34606
% 3.61/1.08 % ...aggressively subsumed : 0
% 3.61/1.08 % Contextual simplify-reflections : 0
% 3.61/1.08 % Paramodulations : 34671
% 3.61/1.08 % Factorizations : 88
% 3.61/1.08 % NegExts : 0
% 3.61/1.08 % Equation resolutions : 22
% 3.61/1.08 % Disequality decompositions : 0
% 3.61/1.08 % Total rewrite steps : 843
% 3.61/1.08 % ...of those cached : 504
% 3.61/1.08 % Propositional unsat checks : 0
% 3.61/1.08 % Propositional check models : 0
% 3.61/1.08 % Propositional check unsatisfiable : 0
% 3.61/1.08 % Propositional clauses : 0
% 3.61/1.08 % Propositional clauses after purity: 0
% 3.61/1.08 % Propositional unsat core size : 0
% 3.61/1.08 % Propositional preprocessing time : 0.000
% 3.61/1.08 % Propositional encoding time : 0.000
% 3.61/1.08 % Propositional solver time : 0.000
% 3.61/1.08 % Success case prop preproc time : 0.000
% 3.61/1.08 % Success case prop encoding time : 0.000
% 3.61/1.08 % Success case prop solver time : 0.000
% 3.61/1.08 % Current number of processed clauses : 266
% 3.61/1.08 % Positive orientable unit clauses : 8
% 3.61/1.08 % Positive unorientable unit clauses: 13
% 3.61/1.08 % Negative unit clauses : 56
% 3.61/1.08 % Non-unit-clauses : 189
% 3.61/1.08 % Current number of unprocessed clauses: 31801
% 3.61/1.08 % ...number of literals in the above : 77942
% 3.61/1.08 % Current number of archived formulas : 0
% 3.61/1.08 % Current number of archived clauses : 30
% 3.61/1.08 % Clause-clause subsumption calls (NU) : 20250
% 3.61/1.08 % Rec. Clause-clause subsumption calls : 20250
% 3.61/1.08 % Non-unit clause-clause subsumptions : 834
% 3.61/1.08 % Unit Clause-clause subsumption calls : 929
% 3.61/1.08 % Rewrite failures with RHS unbound : 0
% 3.61/1.08 % BW rewrite match attempts : 1974
% 3.61/1.08 % BW rewrite match successes : 878
% 3.61/1.08 % Condensation attempts : 0
% 3.61/1.08 % Condensation successes : 0
% 3.61/1.08 % Termbank termtop insertions : 571590
% 3.61/1.08 % Search garbage collected termcells : 84
% 3.61/1.08
% 3.61/1.08 % -------------------------------------------------
% 3.61/1.08 % User time : 0.590 s
% 3.61/1.08 % System time : 0.039 s
% 3.61/1.08 % Total time : 0.629 s
% 3.61/1.08 % Maximum resident set size: 3684 pages
% 3.61/1.08
% 3.61/1.08 % -------------------------------------------------
% 3.61/1.08 % User time : 2.695 s
% 3.61/1.08 % System time : 0.124 s
% 3.61/1.08 % Total time : 2.818 s
% 3.61/1.08 % Maximum resident set size: 4864 pages
% 3.61/1.08 % E exiting
%------------------------------------------------------------------------------