%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ056-2.005 : TPTP v9.3.1. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:01:44 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 49
% Number of leaves : 13
% Syntax : Number of clauses : 79 ( 49 unt; 0 nHn; 60 RR)
% Number of literals : 191 ( 0 equ; 115 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-5 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 136 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule1,axiom,
( ~ p(X1,X2,X3,X4,X5)
| p(X6,X2,X3,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule1) ).
cnf(rule2,axiom,
( ~ neq(X1,X6)
| ~ neq(X1,X2)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X6,X3,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule2) ).
cnf(init,axiom,
p(s0,s0,s0,s0,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
cnf(neq8,axiom,
neq(s2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq8) ).
cnf(neq7,axiom,
neq(s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq7) ).
cnf(rule3,axiom,
( ~ neq(X2,X6)
| ~ neq(X2,X3)
| ~ neq(X1,X6)
| ~ neq(X1,X3)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X6,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule3) ).
cnf(neq4,axiom,
neq(s1,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq4) ).
cnf(neq6,axiom,
neq(s1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq6) ).
cnf(neq3,axiom,
neq(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq3) ).
cnf(neq2,axiom,
neq(s0,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq2) ).
cnf(rule4,axiom,
( ~ neq(X3,X6)
| ~ neq(X3,X4)
| ~ neq(X2,X6)
| ~ neq(X2,X4)
| ~ neq(X1,X6)
| ~ neq(X1,X4)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X3,X6,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule4) ).
cnf(rule5,axiom,
( ~ neq(X4,X6)
| ~ neq(X4,X5)
| ~ neq(X3,X6)
| ~ neq(X3,X5)
| ~ neq(X2,X6)
| ~ neq(X2,X5)
| ~ neq(X1,X6)
| ~ neq(X1,X5)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule5) ).
cnf(goal,negated_conjecture,
~ p(s2,s2,s2,s2,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_13,plain,
( ~ p(X1,X2,X3,X4,X5)
| p(X6,X2,X3,X4,X5) ),
inference(fof_simplification,[status(thm)],[rule1]) ).
cnf(c_0_14,plain,
( ~ neq(X1,X6)
| ~ neq(X1,X2)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X6,X3,X4,X5) ),
inference(fof_simplification,[status(thm)],[rule2]) ).
cnf(c_0_15,plain,
( ~ p(X1,X2,X3,X4,X5)
| p(X6,X2,X3,X4,X5) ),
c_0_13 ).
cnf(c_0_16,axiom,
p(s0,s0,s0,s0,s0),
init ).
cnf(c_0_17,plain,
( ~ neq(X1,X6)
| ~ neq(X1,X2)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X6,X3,X4,X5) ),
c_0_14 ).
cnf(c_0_18,plain,
p(X1,s0,s0,s0,s0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s0)
| p(X1,X2,s0,s0,s0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
neq(s2,s1),
neq8 ).
cnf(c_0_21,axiom,
neq(s2,s0),
neq7 ).
cnf(c_0_22,plain,
( ~ neq(X2,X6)
| ~ neq(X2,X3)
| ~ neq(X1,X6)
| ~ neq(X1,X3)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X6,X4,X5) ),
inference(fof_simplification,[status(thm)],[rule3]) ).
cnf(c_0_23,plain,
p(s2,s1,s0,s0,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( ~ neq(X2,X6)
| ~ neq(X2,X3)
| ~ neq(X1,X6)
| ~ neq(X1,X3)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X6,X4,X5) ),
c_0_22 ).
cnf(c_0_25,plain,
p(X1,s1,s0,s0,s0),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_26,axiom,
neq(s1,s0),
neq4 ).
cnf(c_0_27,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s0)
| ~ neq(s1,X2)
| p(X1,s1,X2,s0,s0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_28,axiom,
neq(s1,s2),
neq6 ).
cnf(c_0_29,plain,
p(s1,s1,s2,s0,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28]),c_0_26])]) ).
cnf(c_0_30,plain,
p(X1,s1,s2,s0,s0),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_31,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s1)
| p(X1,X2,s2,s0,s0) ),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_32,axiom,
neq(s0,s2),
neq3 ).
cnf(c_0_33,axiom,
neq(s0,s1),
neq2 ).
cnf(c_0_34,plain,
( ~ neq(X3,X6)
| ~ neq(X3,X4)
| ~ neq(X2,X6)
| ~ neq(X2,X4)
| ~ neq(X1,X6)
| ~ neq(X1,X4)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X3,X6,X5) ),
inference(fof_simplification,[status(thm)],[rule4]) ).
cnf(c_0_35,plain,
p(s0,s2,s2,s0,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,plain,
( ~ neq(X3,X6)
| ~ neq(X3,X4)
| ~ neq(X2,X6)
| ~ neq(X2,X4)
| ~ neq(X1,X6)
| ~ neq(X1,X4)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X3,X6,X5) ),
c_0_34 ).
cnf(c_0_37,plain,
p(X1,s2,s2,s0,s0),
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_38,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s0)
| ~ neq(s2,X2)
| p(X1,s2,s2,X2,s0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21])]) ).
cnf(c_0_39,plain,
p(s2,s2,s2,s1,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_20]),c_0_20]),c_0_21])]) ).
cnf(c_0_40,plain,
p(X1,s2,s2,s1,s0),
inference(spm,[status(thm)],[c_0_15,c_0_39]) ).
cnf(c_0_41,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s2)
| p(X1,X2,s2,s1,s0) ),
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_42,plain,
p(s1,s0,s2,s1,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_26]),c_0_28])]) ).
cnf(c_0_43,plain,
p(X1,s0,s2,s1,s0),
inference(spm,[status(thm)],[c_0_15,c_0_42]) ).
cnf(c_0_44,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s2)
| ~ neq(s0,X2)
| p(X1,s0,X2,s1,s0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_32])]) ).
cnf(c_0_45,plain,
p(s0,s0,s1,s1,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_33]),c_0_32])]) ).
cnf(c_0_46,plain,
p(X1,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_15,c_0_45]) ).
cnf(c_0_47,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s0)
| p(X1,X2,s1,s1,s0) ),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_48,plain,
( ~ neq(X4,X6)
| ~ neq(X4,X5)
| ~ neq(X3,X6)
| ~ neq(X3,X5)
| ~ neq(X2,X6)
| ~ neq(X2,X5)
| ~ neq(X1,X6)
| ~ neq(X1,X5)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[rule5]) ).
cnf(c_0_49,plain,
p(s2,s1,s1,s1,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_20]),c_0_21])]) ).
cnf(c_0_50,plain,
( ~ neq(X4,X6)
| ~ neq(X4,X5)
| ~ neq(X3,X6)
| ~ neq(X3,X5)
| ~ neq(X2,X6)
| ~ neq(X2,X5)
| ~ neq(X1,X6)
| ~ neq(X1,X5)
| ~ p(X1,X2,X3,X4,X5)
| p(X1,X2,X3,X4,X6) ),
c_0_48 ).
cnf(c_0_51,plain,
p(X1,s1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_15,c_0_49]) ).
cnf(c_0_52,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s0)
| ~ neq(s1,X2)
| p(X1,s1,s1,s1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_26])]) ).
cnf(c_0_53,plain,
p(s1,s1,s1,s1,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_28]),c_0_28]),c_0_26])]) ).
cnf(c_0_54,plain,
p(X1,s1,s1,s1,s2),
inference(spm,[status(thm)],[c_0_15,c_0_53]) ).
cnf(c_0_55,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s1)
| p(X1,X2,s1,s1,s2) ),
inference(spm,[status(thm)],[c_0_17,c_0_54]) ).
cnf(c_0_56,plain,
p(s0,s2,s1,s1,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_32]),c_0_33])]) ).
cnf(c_0_57,plain,
p(X1,s2,s1,s1,s2),
inference(spm,[status(thm)],[c_0_15,c_0_56]) ).
cnf(c_0_58,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s1)
| ~ neq(s2,X2)
| p(X1,s2,X2,s1,s2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_57]),c_0_20])]) ).
cnf(c_0_59,plain,
p(s2,s2,s0,s1,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_21]),c_0_21]),c_0_20])]) ).
cnf(c_0_60,plain,
p(X1,s2,s0,s1,s2),
inference(spm,[status(thm)],[c_0_15,c_0_59]) ).
cnf(c_0_61,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s2)
| p(X1,X2,s0,s1,s2) ),
inference(spm,[status(thm)],[c_0_17,c_0_60]) ).
cnf(c_0_62,plain,
p(s1,s0,s0,s1,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_26]),c_0_28])]) ).
cnf(c_0_63,plain,
p(X1,s0,s0,s1,s2),
inference(spm,[status(thm)],[c_0_15,c_0_62]) ).
cnf(c_0_64,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s1)
| ~ neq(s0,X2)
| p(X1,s0,s0,X2,s2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_63]),c_0_33])]) ).
cnf(c_0_65,plain,
p(s0,s0,s0,s2,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_32]),c_0_32]),c_0_33])]) ).
cnf(c_0_66,plain,
p(X1,s0,s0,s2,s2),
inference(spm,[status(thm)],[c_0_15,c_0_65]) ).
cnf(c_0_67,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s0)
| p(X1,X2,s0,s2,s2) ),
inference(spm,[status(thm)],[c_0_17,c_0_66]) ).
cnf(c_0_68,plain,
p(s2,s1,s0,s2,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_20]),c_0_21])]) ).
cnf(c_0_69,plain,
p(X1,s1,s0,s2,s2),
inference(spm,[status(thm)],[c_0_15,c_0_68]) ).
cnf(c_0_70,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s0)
| ~ neq(s1,X2)
| p(X1,s1,X2,s2,s2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_69]),c_0_26])]) ).
cnf(c_0_71,plain,
p(s1,s1,s2,s2,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_28]),c_0_28]),c_0_26])]) ).
cnf(c_0_72,plain,
p(X1,s1,s2,s2,s2),
inference(spm,[status(thm)],[c_0_15,c_0_71]) ).
cnf(c_0_73,plain,
( ~ neq(X1,X2)
| ~ neq(X1,s1)
| p(X1,X2,s2,s2,s2) ),
inference(spm,[status(thm)],[c_0_17,c_0_72]) ).
cnf(c_0_74,negated_conjecture,
~ p(s2,s2,s2,s2,s2),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_75,plain,
p(s0,s2,s2,s2,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_32]),c_0_33])]) ).
cnf(c_0_76,negated_conjecture,
~ p(s2,s2,s2,s2,s2),
c_0_74 ).
cnf(c_0_77,plain,
p(X1,s2,s2,s2,s2),
inference(spm,[status(thm)],[c_0_15,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ056-2.005 : TPTP v9.3.1. Released v3.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 03:47:51 UTC 2026
% 0.12/0.35 % CPUTime :
% 0.12/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1495868 completed with status 0
% 0.12/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.44 % new_bool_3 with pid 1495878 completed with status 0
% 0.12/0.44 % Result found by new_bool_3
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44 % Presaturation interreduction done
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Unsatisfiable
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 16
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 16
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 16
% 0.12/0.44 % Processed clauses : 498
% 0.12/0.44 % ...of these trivial : 21
% 0.12/0.44 % ...subsumed : 146
% 0.12/0.44 % ...remaining for further processing : 331
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 0
% 0.12/0.44 % Backward-rewritten : 71
% 0.12/0.44 % Generated clauses : 1525
% 0.12/0.44 % ...of the previous two non-redundant : 818
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 1525
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 2085
% 0.12/0.44 % ...of those cached : 1786
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 244
% 0.12/0.44 % Positive orientable unit clauses : 75
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 3
% 0.12/0.44 % Non-unit-clauses : 166
% 0.12/0.44 % Current number of unprocessed clauses: 165
% 0.12/0.44 % ...number of literals in the above : 837
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 87
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 1758
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 867
% 0.12/0.44 % Non-unit clause-clause subsumptions : 0
% 0.12/0.44 % Unit Clause-clause subsumption calls : 113
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 1412
% 0.12/0.44 % BW rewrite match successes : 71
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 30096
% 0.12/0.44 % Search garbage collected termcells : 63
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.028 s
% 0.12/0.44 % System time : 0.004 s
% 0.12/0.44 % Total time : 0.031 s
% 0.12/0.44 % Maximum resident set size: 3640 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.147 s
% 0.12/0.44 % System time : 0.011 s
% 0.12/0.44 % Total time : 0.158 s
% 0.12/0.44 % Maximum resident set size: 4864 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------