%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV487+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:55:44 PM UTC 2026
% Result : Theorem 2.03s 0.72s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 12 unt; 0 def)
% Number of atoms : 192 ( 44 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 208 ( 74 ~; 74 |; 36 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 61 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive) ).
fof(int_less_transitive,axiom,
! [X1,X2,X3] :
( ( int_less(X2,X3)
& int_less(X1,X2) )
=> int_less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive) ).
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( X1 = X2
| int_less(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq) ).
fof(ut,conjecture,
! [X1,X2] :
( ( int_leq(X1,n)
& int_less(X2,X1)
& int_leq(int_one,X2) )
=> a(X1,X2) = real_zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ut) ).
fof(plus_and_inverse,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X3] :
( int_less(int_zero,X3)
& plus(X1,X3) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(one_successor_of_zero,axiom,
! [X1] :
( int_less(int_zero,X1)
<=> int_leq(int_one,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_leq(X2,X1)
| int_less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_total) ).
fof(qiu,hypothesis,
! [X1,X2] :
( ( int_leq(X2,n)
& int_leq(int_one,X2)
& int_leq(X1,n)
& int_leq(int_one,X1) )
=> ( ! [X8] :
( ( X2 = plus(X1,X8)
& int_leq(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X8)) = lu(X3,plus(X3,X8)) ) )
& ! [X8] :
( ( X1 = plus(X2,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(plus(X3,X8),X3) = real_zero ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qiu) ).
fof(c_0_8,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ! [X8] :
( ( X2 = plus(X1,X8)
& int_leq(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X8)) = lu(X3,plus(X3,X8)) ) )
& ! [X8] :
( ( X1 = plus(X2,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(plus(X3,X8),X3) = real_zero ) ) ) ),
introduced(definition) ).
fof(c_0_9,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ! [X8] :
( ( X2 = plus(X1,X8)
& int_leq(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X8)) = lu(X3,plus(X3,X8)) ) )
& ! [X8] :
( ( X1 = plus(X2,X8)
& int_less(int_zero,X8) )
=> ! [X3] :
( ( int_leq(X3,X2)
& int_leq(int_one,X3) )
=> a(plus(X3,X8),X3) = real_zero ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
inference(fof_simplification,[status(thm)],[int_less_irreflexive]) ).
fof(c_0_11,plain,
! [X11,X12,X13] :
( int_less(X11,X13)
| ~ int_less(X12,X13)
| ~ int_less(X11,X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])])]) ).
fof(c_0_12,plain,
! [X9,X10] :
( ( int_leq(X9,X10)
| X9 != X10 )
& ( int_leq(X9,X10)
| ~ int_less(X9,X10) )
& ( X9 = X10
| int_less(X9,X10)
| ~ int_leq(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(X1,n)
& int_less(X2,X1)
& int_leq(int_one,X2) )
=> a(X1,X2) = real_zero ),
inference(assume_negation,[status(cth)],[ut]) ).
fof(c_0_14,plain,
! [X36,X37,X38,X39,X40,X41] :
( ( ~ epred1_2(X37,X36)
| a(X41,plus(X41,X40)) = lu(X41,plus(X41,X40))
| ~ int_leq(X41,X37)
| ~ int_leq(int_one,X41)
| X36 != plus(X37,X40)
| ~ int_leq(int_zero,X40) )
& ( ~ epred1_2(X37,X36)
| a(plus(X39,X38),X39) = real_zero
| ~ int_leq(X39,X36)
| ~ int_leq(int_one,X39)
| X37 != plus(X36,X38)
| ~ int_less(int_zero,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_15,plain,
! [X14,X15] :
( X14 != X15
| ~ int_less(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_16,plain,
( ~ int_less(X2,X3)
| ~ int_less(X1,X2)
| int_less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ int_leq(X1,X2)
| X1 = X2
| int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
( a(esk2_0,esk3_0) != real_zero
& int_leq(esk2_0,n)
& int_less(esk3_0,esk2_0)
& int_leq(int_one,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_19,plain,
( ~ epred1_2(X2,X3)
| ~ int_leq(X4,X3)
| ~ int_leq(int_one,X4)
| X2 != plus(X3,X1)
| ~ int_less(int_zero,X1)
| a(plus(X4,X1),X4) = real_zero ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X25,X26,X28,X29,X30] :
( ( int_less(X28,X29)
| ~ int_less(int_zero,X30)
| plus(X28,X30) != X29 )
& ( ~ int_less(X25,X26)
| int_less(int_zero,esk1_2(X25,X26)) )
& ( ~ int_less(X25,X26)
| plus(X25,esk1_2(X25,X26)) = X26 ) ),
inference(distribute,[status(thm)],[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)],[plus_and_inverse])])])])])])]) ).
cnf(c_0_21,plain,
( X1 != X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ int_leq(X1,X2)
| ~ int_less(X3,X1)
| int_less(X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
int_leq(esk2_0,n),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
int_less(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ int_leq(X1,X3)
| ~ int_leq(int_one,X1)
| ~ int_less(int_zero,X2)
| ~ epred1_2(plus(X3,X2),X3)
| a(plus(X1,X2),X1) = real_zero ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ int_less(X1,X2)
| plus(X1,esk1_2(X1,X2)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ int_less(X1,X2)
| int_less(int_zero,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( X1 != X2
| int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_29,plain,
! [X31] :
( ( int_less(int_zero,X31)
| ~ int_leq(int_one,X31) )
& ( int_leq(int_one,X31)
| ~ int_less(int_zero,X31) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])])]) ).
cnf(c_0_30,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( ~ int_less(X1,esk2_0)
| int_less(X1,n)
| n = esk2_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
( ~ int_less(X1,X2)
| int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
( ~ int_less(X1,esk3_0)
| int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
fof(c_0_34,plain,
! [X16,X17] :
( int_leq(X17,X16)
| int_less(X16,X17) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
cnf(c_0_35,plain,
( ~ int_leq(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_less(X2,X3)
| ~ epred1_2(X3,X2)
| a(plus(X1,esk1_2(X2,X3)),X1) = real_zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_36,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_28]) ).
fof(c_0_37,hypothesis,
! [X1,X2] :
( ( int_leq(X2,n)
& int_leq(int_one,X2)
& int_leq(X1,n)
& int_leq(int_one,X1) )
=> epred1_2(X1,X2) ),
inference(apply_def,[status(thm)],[qiu,c_0_8]) ).
cnf(c_0_38,plain,
( ~ int_less(int_zero,X1)
| int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( ~ int_less(n,esk2_0)
| n = esk2_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( ~ int_less(X1,esk3_0)
| int_leq(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( int_leq(X2,X1)
| int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,plain,
( ~ int_leq(int_one,X2)
| ~ int_less(X2,X1)
| ~ epred1_2(X1,X2)
| a(X1,X2) = real_zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_26]),c_0_36])]) ).
cnf(c_0_44,negated_conjecture,
int_leq(int_one,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_45,hypothesis,
! [X32,X33] :
( epred1_2(X32,X33)
| ~ int_leq(X33,n)
| ~ int_leq(int_one,X33)
| ~ int_leq(X32,n)
| ~ int_leq(int_one,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ int_less(int_zero,esk3_0)
| int_leq(int_one,esk2_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_47,plain,
( ~ int_leq(int_one,X1)
| int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_48,negated_conjecture,
( ~ int_leq(n,esk2_0)
| n = esk2_0 ),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_49,negated_conjecture,
( int_leq(X1,esk2_0)
| int_leq(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
~ epred1_2(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24]),c_0_44])]) ).
cnf(c_0_51,hypothesis,
( ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,negated_conjecture,
int_leq(int_one,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44])]) ).
cnf(c_0_53,negated_conjecture,
( int_leq(esk3_0,n)
| n = esk2_0 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,hypothesis,
~ int_leq(esk3_0,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_23]),c_0_44]),c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
n = esk2_0,
inference(sr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
int_leq(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_57,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV487+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:55:32 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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
% 2.03/0.72 % Version: 3.5.1
% 2.03/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.03/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.03/0.72 % Starting new_bool_3 with 300s (1) cores
% 2.03/0.72 % Starting new_bool_1 with 300s (1) cores
% 2.03/0.72 % Starting sh5l with 300s (1) cores
% 2.03/0.72 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2548259 completed with status 0
% 2.03/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.03/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.03/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.03/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.03/0.72 % No SInE strategy applied
% 2.03/0.72 % Search class: FGHSS-FFSS22-SFFFFFNN
% 2.03/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.03/0.72 % Starting SubtermCWHack with 136s (1) cores
% 2.03/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.03/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.03/0.72 % Starting new_bool_3 with 136s (1) cores
% 2.03/0.72 % Starting new_bool_1 with 136s (1) cores
% 2.03/0.72 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2548266 completed with status 0
% 2.03/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 2.03/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.03/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.03/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.03/0.72 % No SInE strategy applied
% 2.03/0.72 % Search class: FGHSS-FFSS22-SFFFFFNN
% 2.03/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.03/0.72 % Starting SubtermCWHack with 136s (1) cores
% 2.03/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.03/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.03/0.72 % Preprocessing time : 0.002 s
% 2.03/0.72 % Presaturation interreduction done
% 2.03/0.72
% 2.03/0.72 % Proof found!
% 2.03/0.72 % SZS status Theorem
% 2.03/0.72 % SZS output start CNFRefutation
% See solution above
% 2.03/0.72 % Parsed axioms : 13
% 2.03/0.72 % Removed by relevancy pruning/SinE : 0
% 2.03/0.72 % Initial clauses : 23
% 2.03/0.72 % Removed in clause preprocessing : 0
% 2.03/0.72 % Initial clauses in saturation : 23
% 2.03/0.72 % Processed clauses : 3134
% 2.03/0.72 % ...of these trivial : 3
% 2.03/0.72 % ...subsumed : 2507
% 2.03/0.72 % ...remaining for further processing : 624
% 2.03/0.72 % Other redundant clauses eliminated : 5
% 2.03/0.72 % Clauses deleted for lack of memory : 0
% 2.03/0.72 % Backward-subsumed : 48
% 2.03/0.72 % Backward-rewritten : 93
% 2.03/0.72 % Generated clauses : 13332
% 2.03/0.72 % ...of the previous two non-redundant : 10701
% 2.03/0.72 % ...aggressively subsumed : 0
% 2.03/0.72 % Contextual simplify-reflections : 7
% 2.03/0.72 % Paramodulations : 13324
% 2.03/0.72 % Factorizations : 2
% 2.03/0.72 % NegExts : 0
% 2.03/0.72 % Equation resolutions : 5
% 2.03/0.72 % Disequality decompositions : 0
% 2.03/0.72 % Total rewrite steps : 3257
% 2.03/0.72 % ...of those cached : 3231
% 2.03/0.72 % Propositional unsat checks : 0
% 2.03/0.72 % Propositional check models : 0
% 2.03/0.72 % Propositional check unsatisfiable : 0
% 2.03/0.72 % Propositional clauses : 0
% 2.03/0.72 % Propositional clauses after purity: 0
% 2.03/0.72 % Propositional unsat core size : 0
% 2.03/0.72 % Propositional preprocessing time : 0.000
% 2.03/0.72 % Propositional encoding time : 0.000
% 2.03/0.72 % Propositional solver time : 0.000
% 2.03/0.72 % Success case prop preproc time : 0.000
% 2.03/0.72 % Success case prop encoding time : 0.000
% 2.03/0.72 % Success case prop solver time : 0.000
% 2.03/0.72 % Current number of processed clauses : 454
% 2.03/0.72 % Positive orientable unit clauses : 12
% 2.03/0.72 % Positive unorientable unit clauses: 1
% 2.03/0.72 % Negative unit clauses : 8
% 2.03/0.72 % Non-unit-clauses : 433
% 2.03/0.72 % Current number of unprocessed clauses: 7493
% 2.03/0.72 % ...number of literals in the above : 35637
% 2.03/0.72 % Current number of archived formulas : 0
% 2.03/0.72 % Current number of archived clauses : 165
% 2.03/0.72 % Clause-clause subsumption calls (NU) : 34334
% 2.03/0.72 % Rec. Clause-clause subsumption calls : 18925
% 2.03/0.72 % Non-unit clause-clause subsumptions : 2017
% 2.03/0.72 % Unit Clause-clause subsumption calls : 665
% 2.03/0.72 % Rewrite failures with RHS unbound : 0
% 2.03/0.72 % BW rewrite match attempts : 10
% 2.03/0.72 % BW rewrite match successes : 6
% 2.03/0.72 % Condensation attempts : 0
% 2.03/0.72 % Condensation successes : 0
% 2.03/0.72 % Termbank termtop insertions : 153854
% 2.03/0.72 % Search garbage collected termcells : 354
% 2.03/0.72
% 2.03/0.72 % -------------------------------------------------
% 2.03/0.72 % User time : 0.276 s
% 2.03/0.72 % System time : 0.009 s
% 2.03/0.72 % Total time : 0.285 s
% 2.03/0.72 % Maximum resident set size: 3644 pages
% 2.03/0.72
% 2.03/0.72 % -------------------------------------------------
% 2.03/0.72 % User time : 1.286 s
% 2.03/0.72 % System time : 0.075 s
% 2.03/0.72 % Total time : 1.360 s
% 2.03/0.72 % Maximum resident set size: 4608 pages
% 2.03/0.72 % E exiting
%------------------------------------------------------------------------------