%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX241_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:22 PM UTC 2026
% Result : Theorem 2.03s 0.79s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 70 ( 31 unt; 0 def)
% Number of atoms : 141 ( 42 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 137 ( 66 ~; 46 |; 8 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 131 ( 17 sgn 69 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_049,axiom,
! [X1] : ~ elem(X1,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_049) ).
fof(goal_065,conjecture,
? [X10,X20] :
~ ( typeCorrect(X10)
=> ( elem(l,run(X20,X10))
<=> elem(l,run(cons(h,X20),X10)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_065) ).
fof(axiom_054,axiom,
! [X1,X8] :
( eval(X1,var(X8))
<=> elem(X8,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_054) ).
fof(axiom_063,axiom,
! [X1,X15,X13,X14] :
( ~ eval(X1,X15)
=> run(X1,ifThenElse(X15,X13,X14)) = run(X1,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_063) ).
fof(axiom_050,axiom,
! [X1,X8,X17] :
( elem(X1,cons(X8,X17))
<=> ( elem(X1,X17)
| X8 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_050) ).
fof(axiom_058,axiom,
! [X1] : run(X1,skip) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_058) ).
fof(axiom_062,axiom,
! [X1,X15,X13,X14] :
( eval(X1,X15)
=> run(X1,ifThenElse(X15,X13,X14)) = run(X1,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_062) ).
fof(axiom_059,axiom,
! [X1,X8,X9] :
( eval(X1,X9)
=> run(X1,assign(X8,X9)) = cons(X8,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_059) ).
fof(axiom_052,axiom,
! [X1] : eval(X1,tT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_052) ).
fof(axiom_037,axiom,
! [X1] :
( X1 != nand(proj1Nand(X1),proj2Nand(X1))
=> ( X1 != var(proj1Var(X1))
=> ~ secret(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_037) ).
fof(axiom_043,axiom,
! [X9,X2] :
( typeCorrect(assign(low(X2),X9))
<=> ~ secret(X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_043) ).
fof(axiom_045,axiom,
! [X12,X13,X14] :
( typeCorrect(ifThenElse(X12,X13,X14))
<=> ( typeCorrect(X14)
& typeCorrect(X13) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_045) ).
fof(axiom_012,axiom,
! [X1,X2] : nand(X1,X2) != tT,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).
fof(axiom_016,axiom,
! [X1] : tT != var(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
fof(axiom_041,axiom,
typeCorrect(skip),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_041) ).
fof(axiom_047,axiom,
l = low(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_047) ).
fof(c_0_16,plain,
! [X1] : ~ elem(X1,nil),
inference(fof_simplification,[status(thm)],[axiom_049]) ).
fof(c_0_17,negated_conjecture,
~ ? [X10,X20] :
~ ( typeCorrect(X10)
=> ( elem(l,run(X20,X10))
<=> elem(l,run(cons(h,X20),X10)) ) ),
inference(assume_negation,[status(cth)],[goal_065]) ).
fof(c_0_18,plain,
! [X120] : ~ elem(X120,nil),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
fof(c_0_19,plain,
! [X129,X130] :
( ( eval(X129,var(X130))
| ~ elem(X130,X129) )
& ( elem(X130,X129)
| ~ eval(X129,var(X130)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_054])])]) ).
fof(c_0_20,plain,
! [X1,X15,X13,X14] :
( ~ eval(X1,X15)
=> run(X1,ifThenElse(X15,X13,X14)) = run(X1,X14) ),
inference(fof_simplification,[status(thm)],[axiom_063]) ).
fof(c_0_21,negated_conjecture,
! [X159,X160] :
( ( ~ typeCorrect(X159)
| elem(l,run(X160,X159))
| ~ elem(l,run(cons(h,X160),X159)) )
& ( ~ typeCorrect(X159)
| elem(l,run(cons(h,X160),X159))
| ~ elem(l,run(X160,X159)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_22,plain,
~ elem(X1,nil),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( ~ eval(X1,var(X2))
| elem(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X152,X153,X154,X155] :
( run(X152,ifThenElse(X153,X154,X155)) = run(X152,X155)
| eval(X152,X153) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).
fof(c_0_25,plain,
! [X121,X122,X123] :
( ( elem(X121,cons(X122,X123))
| ~ elem(X121,X123) )
& ( elem(X121,cons(X122,X123))
| X122 != X121 )
& ( elem(X121,X123)
| X122 = X121
| ~ elem(X121,cons(X122,X123)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_050])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ typeCorrect(X2)
| ~ elem(l,run(cons(h,X1),X2))
| elem(l,run(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
~ eval(nil,var(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( run(X1,ifThenElse(X2,X3,X4)) = run(X1,X4)
| eval(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( X1 != X2
| elem(X2,cons(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ typeCorrect(X2)
| ~ eval(run(cons(h,X1),X2),var(l))
| elem(l,run(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_31,plain,
run(nil,ifThenElse(var(X1),X2,X3)) = run(nil,X3),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X138] : run(X138,skip) = X138,
inference(variable_rename,[status(thm)],[axiom_058]) ).
fof(c_0_33,plain,
! [X148,X149,X150,X151] :
( run(X148,ifThenElse(X149,X150,X151)) = run(X148,X150)
| ~ eval(X148,X149) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_062])])]) ).
cnf(c_0_34,plain,
( ~ elem(X1,X2)
| eval(X2,var(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_35,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( ~ typeCorrect(ifThenElse(var(X2),X3,X1))
| ~ eval(run(cons(h,nil),ifThenElse(var(X2),X3,X1)),var(l))
| elem(l,run(nil,X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
run(X1,skip) = X1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( ~ eval(X1,X2)
| run(X1,ifThenElse(X2,X3,X4)) = run(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
eval(cons(X1,X2),var(X1)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_40,plain,
! [X139,X140,X141] :
( run(X139,assign(X140,X141)) = cons(X140,X139)
| ~ eval(X139,X141) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_059])])]) ).
fof(c_0_41,plain,
! [X127] : eval(X127,tT),
inference(variable_rename,[status(thm)],[axiom_052]) ).
cnf(c_0_42,negated_conjecture,
( ~ typeCorrect(ifThenElse(var(X1),X2,skip))
| ~ eval(run(cons(h,nil),ifThenElse(var(X1),X2,skip)),var(l)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_22]) ).
cnf(c_0_43,plain,
run(cons(X1,X2),ifThenElse(var(X1),X3,X4)) = run(cons(X1,X2),X3),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( ~ eval(X1,X2)
| run(X1,assign(X3,X2)) = cons(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,plain,
eval(X1,tT),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_46,plain,
! [X1] :
( X1 != nand(proj1Nand(X1),proj2Nand(X1))
=> ( X1 != var(proj1Var(X1))
=> ~ secret(X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_037]) ).
fof(c_0_47,plain,
! [X9,X2] :
( typeCorrect(assign(low(X2),X9))
<=> ~ secret(X9) ),
inference(fof_simplification,[status(thm)],[axiom_043]) ).
cnf(c_0_48,negated_conjecture,
( ~ typeCorrect(ifThenElse(var(h),X1,skip))
| ~ eval(run(cons(h,nil),X1),var(l)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
run(X1,assign(X2,tT)) = cons(X2,X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_50,plain,
! [X104] :
( ~ secret(X104)
| X104 = var(proj1Var(X104))
| X104 = nand(proj1Nand(X104),proj2Nand(X104)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])]) ).
fof(c_0_51,plain,
! [X111,X112] :
( ( typeCorrect(assign(low(X112),X111))
| secret(X111) )
& ( ~ secret(X111)
| ~ typeCorrect(assign(low(X112),X111)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])]) ).
cnf(c_0_52,negated_conjecture,
( ~ typeCorrect(ifThenElse(var(h),assign(X1,tT),skip))
| ~ eval(cons(X1,cons(h,nil)),var(l)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
fof(c_0_53,plain,
! [X115,X116,X117] :
( ( typeCorrect(ifThenElse(X115,X116,X117))
| ~ typeCorrect(X117)
| ~ typeCorrect(X116) )
& ( ~ typeCorrect(ifThenElse(X115,X116,X117))
| typeCorrect(X117) )
& ( ~ typeCorrect(ifThenElse(X115,X116,X117))
| typeCorrect(X116) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_045])])])]) ).
cnf(c_0_54,plain,
( ~ secret(X1)
| X1 = var(proj1Var(X1))
| X1 = nand(proj1Nand(X1),proj2Nand(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,plain,
( typeCorrect(assign(low(X2),X1))
| secret(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_56,plain,
! [X1,X2] : nand(X1,X2) != tT,
inference(fof_simplification,[status(thm)],[axiom_012]) ).
fof(c_0_57,plain,
! [X1] : tT != var(X1),
inference(fof_simplification,[status(thm)],[axiom_016]) ).
cnf(c_0_58,negated_conjecture,
~ typeCorrect(ifThenElse(var(h),assign(l,tT),skip)),
inference(spm,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_59,plain,
( ~ typeCorrect(X2)
| ~ typeCorrect(X1)
| typeCorrect(ifThenElse(X3,X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
typeCorrect(skip),
inference(split_conjunct,[status(thm)],[axiom_041]) ).
cnf(c_0_61,plain,
( typeCorrect(assign(low(X2),X1))
| var(proj1Var(X1)) = X1
| nand(proj1Nand(X1),proj2Nand(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,plain,
l = low(zero),
inference(split_conjunct,[status(thm)],[axiom_047]) ).
fof(c_0_63,plain,
! [X38,X39] : nand(X38,X39) != tT,
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_56])]) ).
fof(c_0_64,plain,
! [X45] : tT != var(X45),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_57])]) ).
cnf(c_0_65,negated_conjecture,
~ typeCorrect(assign(l,tT)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_66,plain,
( typeCorrect(assign(l,X1))
| var(proj1Var(X1)) = X1
| nand(proj1Nand(X1),proj2Nand(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
nand(X1,X2) != tT,
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,plain,
tT != var(X1),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX241_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 10:37:52 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 2.03/0.79 % Version: 3.5.1
% 2.03/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.03/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.03/0.79 % Starting new_bool_3 with 300s (1) cores
% 2.03/0.79 % Starting new_bool_1 with 300s (1) cores
% 2.03/0.79 % Starting sh5l with 300s (1) cores
% 2.03/0.79 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2928077 completed with status 0
% 2.03/0.79 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.03/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.03/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.03/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.03/0.79 % No SInE strategy applied
% 2.03/0.79 % Search class: FGHSM-FFMS31-MFFFFFNN
% 2.03/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.03/0.79 % Starting SubtermCWHack with 136s (1) cores
% 2.03/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.03/0.79 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 2.03/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 2.03/0.79 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 2.03/0.79 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 2928084 completed with status 0
% 2.03/0.79 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 2.03/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.03/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.03/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.03/0.79 % No SInE strategy applied
% 2.03/0.79 % Search class: FGHSM-FFMS31-MFFFFFNN
% 2.03/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.03/0.79 % Starting SubtermCWHack with 136s (1) cores
% 2.03/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.03/0.79 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 2.03/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 2.03/0.79 % Preprocessing time : 0.001 s
% 2.03/0.79 % Presaturation interreduction done
% 2.03/0.79
% 2.03/0.79 % Proof found!
% 2.03/0.79 % SZS status Theorem
% 2.03/0.79 % SZS output start CNFRefutation
% See solution above
% 2.03/0.79 % Parsed axioms : 65
% 2.03/0.79 % Removed by relevancy pruning/SinE : 0
% 2.03/0.79 % Initial clauses : 79
% 2.03/0.79 % Removed in clause preprocessing : 0
% 2.03/0.79 % Initial clauses in saturation : 79
% 2.03/0.79 % Processed clauses : 2112
% 2.03/0.79 % ...of these trivial : 8
% 2.03/0.79 % ...subsumed : 1332
% 2.03/0.79 % ...remaining for further processing : 772
% 2.03/0.79 % Other redundant clauses eliminated : 2
% 2.03/0.79 % Clauses deleted for lack of memory : 0
% 2.03/0.79 % Backward-subsumed : 61
% 2.03/0.79 % Backward-rewritten : 3
% 2.03/0.79 % Generated clauses : 20621
% 2.03/0.79 % ...of the previous two non-redundant : 20096
% 2.03/0.79 % ...aggressively subsumed : 0
% 2.03/0.79 % Contextual simplify-reflections : 0
% 2.03/0.79 % Paramodulations : 20613
% 2.03/0.79 % Factorizations : 6
% 2.03/0.79 % NegExts : 0
% 2.03/0.79 % Equation resolutions : 2
% 2.03/0.79 % Disequality decompositions : 0
% 2.03/0.79 % Total rewrite steps : 3935
% 2.03/0.79 % ...of those cached : 3454
% 2.03/0.79 % Propositional unsat checks : 0
% 2.03/0.79 % Propositional check models : 0
% 2.03/0.79 % Propositional check unsatisfiable : 0
% 2.03/0.79 % Propositional clauses : 0
% 2.03/0.79 % Propositional clauses after purity: 0
% 2.03/0.79 % Propositional unsat core size : 0
% 2.03/0.79 % Propositional preprocessing time : 0.000
% 2.03/0.79 % Propositional encoding time : 0.000
% 2.03/0.79 % Propositional solver time : 0.000
% 2.03/0.79 % Success case prop preproc time : 0.000
% 2.03/0.79 % Success case prop encoding time : 0.000
% 2.03/0.79 % Success case prop solver time : 0.000
% 2.03/0.79 % Current number of processed clauses : 627
% 2.03/0.79 % Positive orientable unit clauses : 108
% 2.03/0.79 % Positive unorientable unit clauses: 0
% 2.03/0.79 % Negative unit clauses : 55
% 2.03/0.79 % Non-unit-clauses : 464
% 2.03/0.79 % Current number of unprocessed clauses: 18031
% 2.03/0.79 % ...number of literals in the above : 53065
% 2.03/0.79 % Current number of archived formulas : 0
% 2.03/0.79 % Current number of archived clauses : 143
% 2.03/0.79 % Clause-clause subsumption calls (NU) : 23818
% 2.03/0.79 % Rec. Clause-clause subsumption calls : 20949
% 2.03/0.79 % Non-unit clause-clause subsumptions : 885
% 2.03/0.79 % Unit Clause-clause subsumption calls : 566
% 2.03/0.79 % Rewrite failures with RHS unbound : 0
% 2.03/0.79 % BW rewrite match attempts : 438
% 2.03/0.79 % BW rewrite match successes : 4
% 2.03/0.79 % Condensation attempts : 0
% 2.03/0.79 % Condensation successes : 0
% 2.03/0.79 % Termbank termtop insertions : 669042
% 2.03/0.79 % Search garbage collected termcells : 534
% 2.03/0.79
% 2.03/0.79 % -------------------------------------------------
% 2.03/0.80 % User time : 0.255 s
% 2.03/0.80 % System time : 0.015 s
% 2.03/0.80 % Total time : 0.270 s
% 2.03/0.80 % Maximum resident set size: 3700 pages
% 2.03/0.80
% 2.03/0.80 % -------------------------------------------------
% 2.03/0.80 % User time : 1.520 s
% 2.03/0.80 % System time : 0.093 s
% 2.03/0.80 % Total time : 1.613 s
% 2.03/0.80 % Maximum resident set size: 4608 pages
% 2.03/0.80 % E exiting
%------------------------------------------------------------------------------