%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX217+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:14:17 PM UTC 2026
% Result : Theorem 0.78s 0.68s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of formulae : 99 ( 80 unt; 0 def)
% Number of atoms : 121 ( 84 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 26 ~; 16 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-2 aty)
% Number of variables : 83 ( 1 sgn 40 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_021,axiom,
! [X6] : rd(cons(i,X6)) = suc(double(rd(X6))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_021) ).
fof(axiom_019,axiom,
! [X1] : double(X1) = addNat(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_019) ).
fof(axiom_022,axiom,
! [X6] : rd(cons(o,X6)) = double(rd(X6)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_022) ).
fof(axiom_011,axiom,
! [X3] :
( evenNat(suc(X3))
<=> ~ evenNat(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_011) ).
fof(axiom_017,axiom,
! [X4] : addNat(zero,X4) = X4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).
fof(axiom_020,axiom,
rd(nil) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_020) ).
fof(axiom_014,axiom,
! [X4] :
( ~ evenNat(suc(X4))
=> shw(suc(X4)) = cons(i,shw(half(suc(X4)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_014) ).
fof(axiom_013,axiom,
! [X4] :
( evenNat(suc(X4))
=> shw(suc(X4)) = cons(o,shw(half(suc(X4)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).
fof(axiom_010,axiom,
evenNat(zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).
fof(axiom_009,axiom,
! [X3] : half(suc(suc(X3))) = suc(half(X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
fof(axiom_008,axiom,
half(suc(zero)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).
fof(axiom_012,axiom,
shw(zero) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_012) ).
fof(axiom_018,axiom,
! [X4,X5] : addNat(suc(X5),X4) = suc(addNat(X5,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_018) ).
fof(axiom_001,axiom,
! [X1,X2] : head(cons(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_001) ).
fof(axiom_007,axiom,
half(zero) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
fof(axiom_006,axiom,
i != o,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
fof(goal_024,conjecture,
? [X1,X4] : x(X1,X4) != x(X4,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_024) ).
fof(axiom_023,axiom,
! [X1,X4] : x(X1,X4) = rd(append(shw(X1),shw(X4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_023) ).
fof(axiom_016,axiom,
! [X4,X5,X6] : append(cons(X5,X6),X4) = cons(X5,append(X6,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_016) ).
fof(axiom_015,axiom,
! [X4] : append(nil,X4) = X4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_015) ).
fof(c_0_20,plain,
! [X27] : rd(cons(i,X27)) = suc(double(rd(X27))),
inference(variable_rename,[status(thm)],[axiom_021]) ).
fof(c_0_21,plain,
! [X26] : double(X26) = addNat(X26,X26),
inference(variable_rename,[status(thm)],[axiom_019]) ).
fof(c_0_22,plain,
! [X28] : rd(cons(o,X28)) = double(rd(X28)),
inference(variable_rename,[status(thm)],[axiom_022]) ).
fof(c_0_23,plain,
! [X3] :
( evenNat(suc(X3))
<=> ~ evenNat(X3) ),
inference(fof_simplification,[status(thm)],[axiom_011]) ).
cnf(c_0_24,plain,
rd(cons(i,X1)) = suc(double(rd(X1))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
double(X1) = addNat(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
rd(cons(o,X1)) = double(rd(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_27,plain,
! [X23] : addNat(zero,X23) = X23,
inference(variable_rename,[status(thm)],[axiom_017]) ).
fof(c_0_28,plain,
! [X16] :
( ( evenNat(suc(X16))
| evenNat(X16) )
& ( ~ evenNat(X16)
| ~ evenNat(suc(X16)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_29,plain,
rd(cons(i,X1)) = suc(addNat(rd(X1),rd(X1))),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
rd(cons(o,X1)) = addNat(rd(X1),rd(X1)),
inference(rw,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_31,plain,
rd(nil) = zero,
inference(split_conjunct,[status(thm)],[axiom_020]) ).
cnf(c_0_32,plain,
addNat(zero,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,plain,
! [X4] :
( ~ evenNat(suc(X4))
=> shw(suc(X4)) = cons(i,shw(half(suc(X4)))) ),
inference(fof_simplification,[status(thm)],[axiom_014]) ).
cnf(c_0_34,plain,
( ~ evenNat(X1)
| ~ evenNat(suc(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
suc(rd(cons(o,X1))) = rd(cons(i,X1)),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
rd(cons(o,nil)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
fof(c_0_37,plain,
! [X17] :
( shw(suc(X17)) = cons(o,shw(half(suc(X17))))
| ~ evenNat(suc(X17)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_013])])]) ).
fof(c_0_38,plain,
! [X18] :
( shw(suc(X18)) = cons(i,shw(half(suc(X18))))
| evenNat(suc(X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])]) ).
cnf(c_0_39,plain,
( ~ evenNat(rd(cons(o,X1)))
| ~ evenNat(rd(cons(i,X1))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
rd(cons(i,nil)) = suc(zero),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
evenNat(zero),
inference(split_conjunct,[status(thm)],[axiom_010]) ).
cnf(c_0_42,plain,
( ~ evenNat(suc(X1))
| shw(suc(X1)) = cons(o,shw(half(suc(X1)))) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( evenNat(suc(X1))
| evenNat(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_44,plain,
! [X15] : half(suc(suc(X15))) = suc(half(X15)),
inference(variable_rename,[status(thm)],[axiom_009]) ).
cnf(c_0_45,plain,
( shw(suc(X1)) = cons(i,shw(half(suc(X1))))
| evenNat(suc(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
half(suc(zero)) = zero,
inference(split_conjunct,[status(thm)],[axiom_008]) ).
cnf(c_0_47,plain,
shw(zero) = nil,
inference(split_conjunct,[status(thm)],[axiom_012]) ).
cnf(c_0_48,plain,
~ evenNat(suc(zero)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]),c_0_41])]) ).
cnf(c_0_49,plain,
( evenNat(X1)
| cons(o,shw(half(suc(X1)))) = shw(suc(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
half(suc(suc(X1))) = suc(half(X1)),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
cons(i,nil) = shw(suc(zero)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]) ).
fof(c_0_52,plain,
! [X24,X25] : addNat(suc(X25),X24) = suc(addNat(X25,X24)),
inference(variable_rename,[status(thm)],[axiom_018]) ).
fof(c_0_53,plain,
! [X7,X8] : head(cons(X7,X8)) = X7,
inference(variable_rename,[status(thm)],[axiom_001]) ).
cnf(c_0_54,plain,
( evenNat(suc(X1))
| cons(o,shw(suc(half(X1)))) = shw(suc(suc(X1))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
half(zero) = zero,
inference(split_conjunct,[status(thm)],[axiom_007]) ).
fof(c_0_56,plain,
i != o,
inference(fof_simplification,[status(thm)],[axiom_006]) ).
cnf(c_0_57,plain,
rd(shw(suc(zero))) = suc(zero),
inference(rw,[status(thm)],[c_0_40,c_0_51]) ).
cnf(c_0_58,plain,
addNat(suc(X1),X2) = suc(addNat(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
head(cons(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
cons(o,shw(suc(zero))) = shw(suc(suc(zero))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_48]) ).
fof(c_0_61,plain,
i != o,
inference(fof_nnf,[status(thm)],[c_0_56]) ).
fof(c_0_62,negated_conjecture,
~ ? [X1,X4] : x(X1,X4) != x(X4,X1),
inference(assume_negation,[status(cth)],[goal_024]) ).
cnf(c_0_63,plain,
( evenNat(X1)
| rd(cons(i,shw(half(suc(X1))))) = suc(rd(shw(suc(X1)))) ),
inference(spm,[status(thm)],[c_0_35,c_0_49]) ).
cnf(c_0_64,plain,
rd(cons(o,shw(suc(zero)))) = suc(suc(zero)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_57]),c_0_58]),c_0_32]) ).
cnf(c_0_65,plain,
( evenNat(suc(X1))
| head(shw(suc(X1))) = i ),
inference(spm,[status(thm)],[c_0_59,c_0_45]) ).
cnf(c_0_66,plain,
head(shw(suc(suc(zero)))) = o,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_67,plain,
i != o,
inference(split_conjunct,[status(thm)],[c_0_61]) ).
fof(c_0_68,negated_conjecture,
~ ? [X1,X4] : x(X1,X4) != x(X4,X1),
inference(fof_simplification,[status(thm)],[c_0_62]) ).
cnf(c_0_69,plain,
half(suc(rd(cons(i,X1)))) = suc(half(rd(cons(o,X1)))),
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
cnf(c_0_70,plain,
( ~ evenNat(suc(rd(shw(suc(X1)))))
| ~ evenNat(rd(cons(o,shw(half(suc(X1))))))
| evenNat(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_63]) ).
cnf(c_0_71,plain,
rd(shw(suc(suc(zero)))) = suc(suc(zero)),
inference(rw,[status(thm)],[c_0_64,c_0_60]) ).
cnf(c_0_72,plain,
evenNat(suc(suc(zero))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
fof(c_0_73,negated_conjecture,
! [X31,X32] : x(X31,X32) = x(X32,X31),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])]) ).
fof(c_0_74,plain,
! [X29,X30] : x(X29,X30) = rd(append(shw(X29),shw(X30))),
inference(variable_rename,[status(thm)],[axiom_023]) ).
fof(c_0_75,plain,
! [X20,X21,X22] : append(cons(X21,X22),X20) = cons(X21,append(X22,X20)),
inference(variable_rename,[status(thm)],[axiom_016]) ).
fof(c_0_76,plain,
! [X19] : append(nil,X19) = X19,
inference(variable_rename,[status(thm)],[axiom_015]) ).
cnf(c_0_77,plain,
( evenNat(rd(cons(i,X1)))
| cons(o,shw(suc(half(rd(cons(o,X1)))))) = shw(suc(rd(cons(i,X1)))) ),
inference(spm,[status(thm)],[c_0_49,c_0_69]) ).
cnf(c_0_78,plain,
rd(cons(i,shw(suc(zero)))) = suc(suc(suc(zero))),
inference(spm,[status(thm)],[c_0_35,c_0_64]) ).
cnf(c_0_79,plain,
~ evenNat(suc(suc(suc(zero)))),
inference(sr,[status(thm)],[inference(cn,[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_70,c_0_71]),c_0_50]),c_0_55]),c_0_60]),c_0_71]),c_0_72])]),c_0_48]) ).
cnf(c_0_80,negated_conjecture,
x(X1,X2) = x(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_81,plain,
x(X1,X2) = rd(append(shw(X1),shw(X2))),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,plain,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_83,plain,
append(nil,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_84,plain,
rd(cons(o,cons(o,shw(suc(zero))))) = suc(suc(suc(suc(zero)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_64]),c_0_58]),c_0_58]),c_0_32]) ).
cnf(c_0_85,plain,
cons(o,shw(suc(suc(zero)))) = shw(suc(suc(suc(suc(zero))))),
inference(sr,[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_77,c_0_60]),c_0_71]),c_0_50]),c_0_55]),c_0_78]),c_0_78]),c_0_79]) ).
cnf(c_0_86,negated_conjecture,
rd(append(shw(X1),shw(X2))) = rd(append(shw(X2),shw(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_81]) ).
cnf(c_0_87,plain,
append(shw(suc(zero)),X1) = cons(i,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_51]),c_0_83]) ).
cnf(c_0_88,plain,
rd(cons(o,shw(suc(suc(zero))))) = suc(suc(suc(suc(zero)))),
inference(spm,[status(thm)],[c_0_84,c_0_60]) ).
cnf(c_0_89,plain,
head(shw(suc(suc(suc(suc(zero)))))) = o,
inference(spm,[status(thm)],[c_0_59,c_0_85]) ).
cnf(c_0_90,negated_conjecture,
rd(append(shw(X1),shw(suc(zero)))) = rd(cons(i,shw(X1))),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_91,plain,
append(shw(suc(suc(zero))),X1) = cons(o,cons(i,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_60]),c_0_87]) ).
cnf(c_0_92,plain,
rd(cons(o,cons(i,shw(suc(zero))))) = suc(suc(suc(suc(suc(suc(zero)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_78]),c_0_58]),c_0_58]),c_0_58]),c_0_32]) ).
cnf(c_0_93,plain,
rd(cons(i,shw(suc(suc(zero))))) = suc(suc(suc(suc(suc(zero))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_84]),c_0_60]) ).
cnf(c_0_94,plain,
rd(shw(suc(suc(suc(suc(zero)))))) = suc(suc(suc(suc(zero)))),
inference(rw,[status(thm)],[c_0_88,c_0_85]) ).
cnf(c_0_95,plain,
evenNat(suc(suc(suc(suc(zero))))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_89]),c_0_67]) ).
cnf(c_0_96,negated_conjecture,
suc(suc(suc(suc(suc(suc(zero)))))) = suc(suc(suc(suc(suc(zero))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),c_0_93]) ).
cnf(c_0_97,plain,
~ evenNat(suc(suc(suc(suc(suc(zero)))))),
inference(sr,[status(thm)],[inference(cn,[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_70,c_0_94]),c_0_50]),c_0_50]),c_0_55]),c_0_85]),c_0_94]),c_0_95])]),c_0_79]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_96]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX217+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.50 % Computer : n014.cluster.edu
% 0.22/0.50 % Model : x86_64 x86_64
% 0.22/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.50 % Memory : 8046.5625MB
% 0.22/0.50 % OS : Linux 6.8.0-71-generic
% 0.22/0.50 % CPULimit : 300
% 0.22/0.50 % WCLimit : 300
% 0.22/0.50 % DateTime : Mon Sep 21 10:34:49 UTC 2026
% 0.22/0.51 % CPUTime :
% 0.22/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.57 Running first-order theorem proving
% 0.25/0.57 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.78/0.68 % Version: 3.5.1
% 0.78/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.78/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.78/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.78/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.78/0.68 % Starting sh5l with 300s (1) cores
% 0.78/0.68 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3842006 completed with status 0
% 0.78/0.68 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.78/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.78/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.78/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.78/0.68 % No SInE strategy applied
% 0.78/0.68 % Search class: FGHSM-FFSS21-MFFFFFNN
% 0.78/0.68 % partial match(1): FGHSM-FFSF21-MFFFFFNN
% 0.78/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.78/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.78/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.78/0.68 % Starting new_bool_3 with 136s (1) cores
% 0.78/0.68 % Starting new_bool_1 with 136s (1) cores
% 0.78/0.68 % new_bool_3 with pid 3842013 completed with status 0
% 0.78/0.68 % Result found by new_bool_3
% 0.78/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.78/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.78/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.78/0.68 % No SInE strategy applied
% 0.78/0.68 % Search class: FGHSM-FFSS21-MFFFFFNN
% 0.78/0.68 % partial match(1): FGHSM-FFSF21-MFFFFFNN
% 0.78/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.78/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.78/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.78/0.68 % Starting new_bool_3 with 136s (1) cores
% 0.78/0.68 % Preprocessing time : 0.002 s
% 0.78/0.68 % Presaturation interreduction done
% 0.78/0.68
% 0.78/0.68 % Proof found!
% 0.78/0.68 % SZS status Theorem
% 0.78/0.68 % SZS output start CNFRefutation
% See solution above
% 0.78/0.68 % Parsed axioms : 24
% 0.78/0.68 % Removed by relevancy pruning/SinE : 0
% 0.78/0.68 % Initial clauses : 25
% 0.78/0.68 % Removed in clause preprocessing : 2
% 0.78/0.68 % Initial clauses in saturation : 23
% 0.78/0.68 % Processed clauses : 738
% 0.78/0.68 % ...of these trivial : 24
% 0.78/0.68 % ...subsumed : 451
% 0.78/0.68 % ...remaining for further processing : 263
% 0.78/0.68 % Other redundant clauses eliminated : 0
% 0.78/0.68 % Clauses deleted for lack of memory : 0
% 0.78/0.68 % Backward-subsumed : 8
% 0.78/0.68 % Backward-rewritten : 28
% 0.78/0.68 % Generated clauses : 2094
% 0.78/0.68 % ...of the previous two non-redundant : 1785
% 0.78/0.68 % ...aggressively subsumed : 0
% 0.78/0.68 % Contextual simplify-reflections : 1
% 0.78/0.68 % Paramodulations : 2094
% 0.78/0.68 % Factorizations : 0
% 0.78/0.68 % NegExts : 0
% 0.78/0.68 % Equation resolutions : 0
% 0.78/0.68 % Disequality decompositions : 0
% 0.78/0.68 % Total rewrite steps : 2830
% 0.78/0.68 % ...of those cached : 2637
% 0.78/0.68 % Propositional unsat checks : 0
% 0.78/0.68 % Propositional check models : 0
% 0.78/0.68 % Propositional check unsatisfiable : 0
% 0.78/0.68 % Propositional clauses : 0
% 0.78/0.68 % Propositional clauses after purity: 0
% 0.78/0.68 % Propositional unsat core size : 0
% 0.78/0.68 % Propositional preprocessing time : 0.000
% 0.78/0.68 % Propositional encoding time : 0.000
% 0.78/0.68 % Propositional solver time : 0.000
% 0.78/0.68 % Success case prop preproc time : 0.000
% 0.78/0.68 % Success case prop encoding time : 0.000
% 0.78/0.68 % Success case prop solver time : 0.000
% 0.78/0.68 % Current number of processed clauses : 204
% 0.78/0.68 % Positive orientable unit clauses : 63
% 0.78/0.68 % Positive unorientable unit clauses: 4
% 0.78/0.68 % Negative unit clauses : 29
% 0.78/0.68 % Non-unit-clauses : 108
% 0.78/0.68 % Current number of unprocessed clauses: 1080
% 0.78/0.68 % ...number of literals in the above : 2646
% 0.78/0.68 % Current number of archived formulas : 0
% 0.78/0.68 % Current number of archived clauses : 61
% 0.78/0.68 % Clause-clause subsumption calls (NU) : 3037
% 0.78/0.68 % Rec. Clause-clause subsumption calls : 2684
% 0.78/0.68 % Non-unit clause-clause subsumptions : 231
% 0.78/0.68 % Unit Clause-clause subsumption calls : 579
% 0.78/0.68 % Rewrite failures with RHS unbound : 0
% 0.78/0.68 % BW rewrite match attempts : 197
% 0.78/0.68 % BW rewrite match successes : 11
% 0.78/0.68 % Condensation attempts : 0
% 0.78/0.68 % Condensation successes : 0
% 0.78/0.68 % Termbank termtop insertions : 40170
% 0.78/0.68 % Search garbage collected termcells : 58
% 0.78/0.68
% 0.78/0.68 % -------------------------------------------------
% 0.78/0.68 % User time : 0.077 s
% 0.78/0.68 % System time : 0.005 s
% 0.78/0.68 % Total time : 0.083 s
% 0.78/0.68 % Maximum resident set size: 3648 pages
% 0.78/0.68
% 0.78/0.68 % -------------------------------------------------
% 0.78/0.68 % User time : 0.285 s
% 0.78/0.68 % System time : 0.023 s
% 0.78/0.68 % Total time : 0.308 s
% 0.78/0.68 % Maximum resident set size: 4864 pages
% 0.78/0.68 % E exiting
%------------------------------------------------------------------------------