%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM856+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 01:56:46 PM UTC 2026
% Result : Theorem 0.16s 5.70s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 71 ( 31 unt; 0 def)
% Number of atoms : 135 ( 64 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 111 ( 47 ~; 51 |; 9 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 122 ( 11 sgn 68 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(73, 0), 0)',axiom,
! [X95,X96] : X96 != vplus(X95,X96),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X102,X103,X104] : vplus(vplus(X102,X103),X104) = vplus(X102,vplus(X103,X104)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X74,X75] :
( geq(X75,X74)
<=> ( X75 = X74
| greater(X75,X74) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('dis(antec(scope(318)))',axiom,
( ( greater(vd517,vd518)
& geq(vd519,vd520) )
| ( geq(vd517,vd518)
& greater(vd519,vd520) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dis(antec(scope(318)))') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X97,X98] : vplus(X98,X97) = vplus(X97,X98),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X85,X86] :
( greater(X86,X85)
<=> ? [X87] : X86 = vplus(X85,X87) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('holds(conseq(scope(318)), 525, 0)',conjecture,
greater(vmul(vd517,vd519),vmul(vd518,vd520)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(scope(318)), 525, 0)') ).
fof('ass(cond(goal(88), 0), 1)',axiom,
! [X88,X89] :
( ~ ? [X91] : X89 = vplus(X88,X91)
| X88 != X89 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof('ass(cond(312, 0), 0)',axiom,
! [X1,X2,X3,X4] :
( ( greater(X1,X2)
& greater(X3,X4) )
=> greater(vmul(X1,X3),vmul(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(312, 0), 0)') ).
fof('ass(cond(299, 0), 2)',axiom,
! [X14,X19,X20] :
( greater(X19,X20)
=> greater(vmul(X19,X14),vmul(X20,X14)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(299, 0), 2)') ).
fof('ass(cond(goal(130), 0), 3)',axiom,
! [X80,X81] :
( ~ greater(X80,X81)
| X80 != X81 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).
fof('ass(cond(189, 0), 0)',axiom,
! [X57,X58] : greater(vplus(X57,X58),X57),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(189, 0), 0)') ).
fof('ass(cond(281, 0), 0)',axiom,
! [X24,X25,X26] : vmul(X24,vplus(X25,X26)) = vplus(vmul(X24,X25),vmul(X24,X26)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(281, 0), 0)') ).
fof('ass(cond(goal(88), 0), 0)',axiom,
! [X88,X89] :
( ? [X91] : X89 = vplus(X88,X91)
| ? [X90] : X88 = vplus(X89,X90)
| X88 = X89 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 0)') ).
fof(c_0_14,plain,
! [X95,X96] : X96 != vplus(X95,X96),
inference(fof_simplification,[status(thm)],['ass(cond(73, 0), 0)']) ).
fof(c_0_15,plain,
! [X244,X245] : X245 != vplus(X244,X245),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
fof(c_0_16,plain,
! [X251,X252,X253] : vplus(vplus(X251,X252),X253) = vplus(X251,vplus(X252,X253)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_17,plain,
! [X201,X202] :
( ( geq(X202,X201)
| X202 != X201 )
& ( geq(X202,X201)
| ~ greater(X202,X201) )
& ( X202 = X201
| greater(X202,X201)
| ~ geq(X202,X201) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])]) ).
fof(c_0_18,plain,
( ( geq(vd517,vd518)
| greater(vd517,vd518) )
& ( geq(vd517,vd518)
| geq(vd519,vd520) )
& ( greater(vd519,vd520)
| greater(vd517,vd518) )
& ( greater(vd519,vd520)
| geq(vd519,vd520) ) ),
inference(distribute,[status(thm)],['dis(antec(scope(318)))']) ).
cnf(c_0_19,plain,
X1 != vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X246,X247] : vplus(X247,X246) = vplus(X246,X247),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_22,plain,
! [X221,X222,X224,X225,X226] :
( ( greater(X225,X224)
| X225 != vplus(X224,X226) )
& ( X222 = vplus(X221,esk2_2(X221,X222))
| ~ greater(X222,X221) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).
cnf(c_0_23,plain,
( ~ geq(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( greater(vd519,vd520)
| geq(vd519,vd520) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(assume_negation,[status(cth)],['holds(conseq(scope(318)), 525, 0)']) ).
cnf(c_0_26,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( greater(vd519,vd520)
| vd520 = vd519 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,plain,
! [X88,X89] :
( ~ ? [X91] : X89 = vplus(X88,X91)
| X88 != X89 ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(88), 0), 1)']) ).
fof(c_0_31,plain,
! [X114,X115,X116,X117] :
( greater(vmul(X114,X116),vmul(X115,X117))
| ~ greater(X114,X115)
| ~ greater(X116,X117) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(312, 0), 0)'])])]) ).
cnf(c_0_32,plain,
( geq(vd517,vd518)
| greater(vd517,vd518) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_33,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( vd520 = vd519
| vplus(vd520,esk2_2(vd520,vd519)) = vd519 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_36,plain,
! [X231,X232,X233] :
( X232 != vplus(X231,X233)
| X231 != X232 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).
cnf(c_0_37,plain,
( ~ greater(X3,X4)
| ~ greater(X1,X2)
| greater(vmul(X3,X1),vmul(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( greater(vd517,vd518)
| vd518 = vd517 ),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
fof(c_0_39,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(fof_nnf,[status(thm)],[c_0_33]) ).
fof(c_0_40,plain,
! [X133,X134,X135] :
( greater(vmul(X134,X133),vmul(X135,X133))
| ~ greater(X134,X135) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])])]) ).
fof(c_0_41,plain,
! [X80,X81] :
( ~ greater(X80,X81)
| X80 != X81 ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)']) ).
fof(c_0_42,plain,
! [X184,X185] : greater(vplus(X184,X185),X184),
inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).
fof(c_0_43,plain,
! [X139,X140,X141] : vmul(X139,vplus(X140,X141)) = vplus(vmul(X139,X140),vmul(X139,X141)),
inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).
cnf(c_0_44,plain,
( vplus(X1,vd519) != vd520
| vd520 = vd519 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_45,plain,
! [X227,X228] :
( X228 = vplus(X227,esk4_2(X227,X228))
| X227 = vplus(X228,esk3_2(X227,X228))
| X227 = X228 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['ass(cond(goal(88), 0), 0)'])]) ).
cnf(c_0_46,plain,
( X2 != vplus(X1,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
( greater(vd519,vd520)
| greater(vd517,vd518) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_48,plain,
( ~ greater(X1,X2)
| greater(vmul(vd517,X1),vmul(vd518,X2))
| vd518 = vd517 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_50,plain,
( ~ greater(X1,X2)
| greater(vmul(X1,X3),vmul(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_51,plain,
! [X213,X214] :
( ~ greater(X213,X214)
| X213 != X214 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_41])]) ).
cnf(c_0_52,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_53,plain,
vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,plain,
( vplus(vd519,X1) != vd520
| vd520 = vd519 ),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_55,plain,
( X2 = vplus(X1,esk4_2(X1,X2))
| X1 = vplus(X2,esk3_2(X1,X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_57,plain,
( greater(vd517,vd518)
| vplus(vd520,esk2_2(vd520,vd519)) = vd519 ),
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_58,plain,
( vd518 = vd517
| vd520 = vd519 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_29]),c_0_49]) ).
cnf(c_0_59,plain,
( greater(vmul(vd517,X1),vmul(vd518,X1))
| vd518 = vd517 ),
inference(spm,[status(thm)],[c_0_50,c_0_38]) ).
cnf(c_0_60,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
greater(vmul(X1,vplus(X2,X3)),vmul(X1,X2)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
( vd520 = vd519
| vplus(vd520,esk4_2(vd520,vd519)) = vd519 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_63,plain,
( vd520 != vd519
| greater(vd517,vd518) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
vd518 = vd517,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_58]),c_0_59]) ).
cnf(c_0_65,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_66,plain,
( greater(vmul(X1,vd519),vmul(X1,vd520))
| vd520 = vd519 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
vd520 != vd519,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd517,vd520)),
inference(spm,[status(thm)],[c_0_49,c_0_64]) ).
cnf(c_0_69,plain,
greater(vmul(X1,vd519),vmul(X1,vd520)),
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM856+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n016.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 03:18:28 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.70 % Version: 3.5.1
% 0.16/5.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.70 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.70 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.70 % Starting sh5l with 300s (1) cores
% 0.16/5.70 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1430353 completed with status 0
% 0.16/5.70 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/5.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.70 % No SInE strategy applied
% 0.16/5.70 % Search class: FGHSM-FFMS21-SFFFFFNN
% 0.16/5.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.70 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/5.70 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/5.70 % Starting new_bool_3 with 136s (1) cores
% 0.16/5.70 % Starting new_bool_1 with 136s (1) cores
% 0.16/5.70 % new_bool_3 with pid 1430363 completed with status 0
% 0.16/5.70 % Result found by new_bool_3
% 0.16/5.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.70 % No SInE strategy applied
% 0.16/5.70 % Search class: FGHSM-FFMS21-SFFFFFNN
% 0.16/5.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.70 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/5.70 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/5.70 % Starting new_bool_3 with 136s (1) cores
% 0.16/5.70 % Preprocessing time : 0.001 s
% 0.16/5.70 % Presaturation interreduction done
% 0.16/5.70
% 0.16/5.70 % Proof found!
% 0.16/5.70 % SZS status Theorem
% 0.16/5.70 % SZS output start CNFRefutation
% See solution above
% 0.16/5.70 % Parsed axioms : 59
% 0.16/5.70 % Removed by relevancy pruning/SinE : 0
% 0.16/5.70 % Initial clauses : 72
% 0.16/5.70 % Removed in clause preprocessing : 3
% 0.16/5.70 % Initial clauses in saturation : 69
% 0.16/5.70 % Processed clauses : 4142
% 0.16/5.70 % ...of these trivial : 65
% 0.16/5.70 % ...subsumed : 3150
% 0.16/5.70 % ...remaining for further processing : 927
% 0.16/5.70 % Other redundant clauses eliminated : 100
% 0.16/5.70 % Clauses deleted for lack of memory : 0
% 0.16/5.70 % Backward-subsumed : 55
% 0.16/5.70 % Backward-rewritten : 280
% 0.16/5.70 % Generated clauses : 26622
% 0.16/5.70 % ...of the previous two non-redundant : 26016
% 0.16/5.70 % ...aggressively subsumed : 0
% 0.16/5.70 % Contextual simplify-reflections : 1
% 0.16/5.70 % Paramodulations : 26448
% 0.16/5.70 % Factorizations : 2
% 0.16/5.70 % NegExts : 0
% 0.16/5.70 % Equation resolutions : 106
% 0.16/5.70 % Disequality decompositions : 0
% 0.16/5.70 % Total rewrite steps : 9154
% 0.16/5.70 % ...of those cached : 7167
% 0.16/5.70 % Propositional unsat checks : 0
% 0.16/5.70 % Propositional check models : 0
% 0.16/5.70 % Propositional check unsatisfiable : 0
% 0.16/5.70 % Propositional clauses : 0
% 0.16/5.70 % Propositional clauses after purity: 0
% 0.16/5.70 % Propositional unsat core size : 0
% 0.16/5.70 % Propositional preprocessing time : 0.000
% 0.16/5.70 % Propositional encoding time : 0.000
% 0.16/5.70 % Propositional solver time : 0.000
% 0.16/5.70 % Success case prop preproc time : 0.000
% 0.16/5.70 % Success case prop encoding time : 0.000
% 0.16/5.70 % Success case prop solver time : 0.000
% 0.16/5.70 % Current number of processed clauses : 458
% 0.16/5.70 % Positive orientable unit clauses : 75
% 0.16/5.70 % Positive unorientable unit clauses: 22
% 0.16/5.70 % Negative unit clauses : 208
% 0.16/5.70 % Non-unit-clauses : 153
% 0.16/5.70 % Current number of unprocessed clauses: 21926
% 0.16/5.70 % ...number of literals in the above : 34683
% 0.16/5.70 % Current number of archived formulas : 0
% 0.16/5.70 % Current number of archived clauses : 461
% 0.16/5.70 % Clause-clause subsumption calls (NU) : 77869
% 0.16/5.70 % Rec. Clause-clause subsumption calls : 67526
% 0.16/5.70 % Non-unit clause-clause subsumptions : 1689
% 0.16/5.70 % Unit Clause-clause subsumption calls : 11486
% 0.16/5.70 % Rewrite failures with RHS unbound : 0
% 0.16/5.70 % BW rewrite match attempts : 391
% 0.16/5.70 % BW rewrite match successes : 112
% 0.16/5.70 % Condensation attempts : 0
% 0.16/5.70 % Condensation successes : 0
% 0.16/5.70 % Termbank termtop insertions : 252736
% 0.16/5.70 % Search garbage collected termcells : 771
% 0.16/5.70
% 0.16/5.70 % -------------------------------------------------
% 0.16/5.70 % User time : 0.224 s
% 0.16/5.70 % System time : 0.019 s
% 0.16/5.70 % Total time : 0.242 s
% 0.16/5.70 % Maximum resident set size: 3992 pages
% 0.16/5.70
% 0.16/5.70 % -------------------------------------------------
% 0.16/5.70 % User time : 1.119 s
% 0.16/5.70 % System time : 0.085 s
% 0.16/5.70 % Total time : 1.204 s
% 0.16/5.70 % Maximum resident set size: 4864 pages
% 0.16/5.70 % E exiting
%------------------------------------------------------------------------------