%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWW101+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 03:11:39 PM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 31 unt; 0 def)
% Number of atoms : 230 ( 98 equ)
% Maximal formula atoms : 75 ( 3 avg)
% Number of connectives : 255 ( 96 ~; 104 |; 49 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 3 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 : 47 ( 2 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(def_false2,axiom,
? [X5] :
( ~ ? [X10] : forallprefers(f7(X10),f7(X5))
& false2 = phi(f7(X5)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_false2) ).
fof(def_f7,axiom,
! [X5] : f7(X5) = lazy_impl(prop(X5),X5),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_f7) ).
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_false) ).
fof(lazy_impl_axiom3,axiom,
! [X4] : lazy_impl(true,X4) = phi(X4),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom3) ).
fof(def_phi,axiom,
! [X1] :
( ( phi(X1) = err
& ~ d(X1) )
| ( phi(X1) = X1
& d(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_phi) ).
fof(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_true) ).
fof(def_forallprefers,axiom,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( X2 = true
& X1 = false )
| ( bool(X2)
& ~ bool(X1)
& d(X2)
& d(X1) )
| ( d(X2)
& ~ d(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_forallprefers) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = true
| X1 = false ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_bool) ).
fof(false1_false2,conjecture,
false1 = false2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',false1_false2) ).
fof(false_true_err_in_d,axiom,
( d(err)
& d(false)
& d(true) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',false_true_err_in_d) ).
fof(def_false1,axiom,
false1 = false,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_false1) ).
fof(distinct_false_true_err,axiom,
( false != err
& true != err
& true != false ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',distinct_false_true_err) ).
fof(c_0_13,plain,
! [X83] :
( ~ forallprefers(f7(X83),f7(esk7_0))
& false2 = phi(f7(esk7_0)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])])]) ).
fof(c_0_14,plain,
! [X81] : f7(X81) = lazy_impl(prop(X81),X81),
inference(variable_rename,[status(thm)],[def_f7]) ).
fof(c_0_15,plain,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
inference(fof_simplification,[status(thm)],[prop_false]) ).
fof(c_0_16,plain,
! [X28] : lazy_impl(true,X28) = phi(X28),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_17,plain,
! [X1] :
( ( phi(X1) = err
& ~ d(X1) )
| ( phi(X1) = X1
& d(X1) ) ),
inference(fof_simplification,[status(thm)],[def_phi]) ).
cnf(c_0_18,plain,
~ forallprefers(f7(X1),f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X18] :
( ( prop(X18) = false
| bool(X18) )
& ( ~ bool(X18)
| prop(X18) != false ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_21,plain,
! [X27] : lazy_impl(false,X27) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
cnf(c_0_22,plain,
false2 = phi(f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X17] :
( ( prop(X17) = true
| ~ bool(X17) )
& ( bool(X17)
| prop(X17) != true ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])])]) ).
fof(c_0_25,plain,
! [X16] :
( ( phi(X16) = X16
| phi(X16) = err )
& ( phi(X16) = X16
| ~ d(X16) )
& ( d(X16)
| phi(X16) = err )
& ( d(X16)
| ~ d(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])])]) ).
cnf(c_0_26,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_27,plain,
( prop(X1) = false
| bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( X2 = true
& X1 = false )
| ( bool(X2)
& ~ bool(X1)
& d(X2)
& d(X1) )
| ( d(X2)
& ~ d(X1) ) ) ),
inference(fof_simplification,[status(thm)],[def_forallprefers]) ).
cnf(c_0_30,plain,
false2 = lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_19]) ).
cnf(c_0_31,plain,
( ~ bool(X1)
| prop(X1) = true ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ d(X1)
| phi(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( ~ forallprefers(lazy_impl(prop(X1),X1),true)
| bool(esk7_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
fof(c_0_34,plain,
! [X12,X13] :
( ( forallprefers(X12,X13)
| X13 != true
| X12 != false )
& ( forallprefers(X12,X13)
| ~ bool(X13)
| bool(X12)
| ~ d(X13)
| ~ d(X12) )
& ( forallprefers(X12,X13)
| ~ d(X13)
| d(X12) )
& ( ~ forallprefers(X12,X13)
| d(X13)
| bool(X13)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| d(X13)
| bool(X13)
| X12 = false )
& ( ~ forallprefers(X12,X13)
| d(X13)
| ~ bool(X12)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| d(X13)
| ~ bool(X12)
| X12 = false )
& ( ~ forallprefers(X12,X13)
| d(X13)
| d(X13)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| d(X13)
| d(X13)
| X12 = false )
& ( ~ forallprefers(X12,X13)
| d(X13)
| d(X12)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| d(X13)
| d(X12)
| X12 = false )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| bool(X13)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| bool(X13)
| X12 = false )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| ~ bool(X12)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| ~ bool(X12)
| X12 = false )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| d(X13)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| d(X13)
| X12 = false )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| d(X12)
| X13 = true )
& ( ~ forallprefers(X12,X13)
| ~ d(X12)
| d(X12)
| X12 = false ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
fof(c_0_35,plain,
! [X11] :
( ( bool(X11)
| X11 != true )
& ( bool(X11)
| X11 != false )
& ( X11 = true
| X11 = false
| ~ bool(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])])]) ).
fof(c_0_36,negated_conjecture,
false1 != false2,
inference(assume_negation,[status(cth)],[false1_false2]) ).
cnf(c_0_37,plain,
( ~ bool(esk7_0)
| lazy_impl(true,lazy_impl(true,esk7_0)) = false2 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ~ d(X1)
| lazy_impl(true,X1) = X1 ),
inference(rw,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_39,plain,
( ~ bool(X1)
| ~ forallprefers(lazy_impl(true,X1),true)
| bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_40,plain,
( X2 != true
| X1 != false
| forallprefers(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( X1 != false
| bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_42,negated_conjecture,
false1 != false2,
inference(fof_simplification,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( ~ bool(esk7_0)
| ~ d(esk7_0)
| lazy_impl(true,esk7_0) = false2 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( ~ bool(X1)
| ~ d(X1)
| ~ forallprefers(X1,true)
| bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_45,plain,
forallprefers(false,true),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_40])]) ).
cnf(c_0_46,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_47,plain,
bool(false),
inference(er,[status(thm)],[c_0_41]) ).
fof(c_0_48,negated_conjecture,
false1 != false2,
inference(fof_nnf,[status(thm)],[c_0_42]) ).
cnf(c_0_49,plain,
( phi(X1) = X1
| phi(X1) = err ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_50,plain,
( ~ bool(esk7_0)
| ~ d(esk7_0)
| false2 = esk7_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_43]) ).
cnf(c_0_51,plain,
bool(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47])]) ).
cnf(c_0_52,plain,
( ~ bool(X1)
| X1 = true
| X1 = false ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,negated_conjecture,
false1 != false2,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
false1 = false,
inference(split_conjunct,[status(thm)],[def_false1]) ).
cnf(c_0_55,plain,
( lazy_impl(true,X1) = err
| lazy_impl(true,X1) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_23]),c_0_23]) ).
cnf(c_0_56,plain,
( ~ d(esk7_0)
| false2 = esk7_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_57,plain,
( esk7_0 = true
| esk7_0 = false ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
false2 != false,
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
fof(c_0_59,plain,
( false != err
& true != err
& true != false ),
inference(fof_simplification,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_60,plain,
( false2 = err
| lazy_impl(prop(esk7_0),esk7_0) = false2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_55]),c_0_30]) ).
cnf(c_0_61,plain,
esk7_0 = true,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_46])]),c_0_58]) ).
cnf(c_0_62,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
fof(c_0_63,plain,
( false != err
& true != err
& true != false ),
inference(fof_nnf,[status(thm)],[c_0_59]) ).
cnf(c_0_64,plain,
( ~ forallprefers(lazy_impl(prop(X1),X1),false2)
| false2 = err ),
inference(spm,[status(thm)],[c_0_26,c_0_60]) ).
cnf(c_0_65,plain,
false2 = true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_61]),c_0_61]),c_0_62])]) ).
cnf(c_0_66,plain,
true != err,
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,plain,
~ forallprefers(lazy_impl(prop(X1),X1),true),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_65]),c_0_66]) ).
cnf(c_0_68,plain,
( ~ bool(X1)
| ~ forallprefers(lazy_impl(true,X1),true) ),
inference(spm,[status(thm)],[c_0_67,c_0_31]) ).
cnf(c_0_69,plain,
( ~ bool(X1)
| ~ d(X1)
| ~ forallprefers(X1,true) ),
inference(spm,[status(thm)],[c_0_68,c_0_38]) ).
cnf(c_0_70,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_45]),c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW101+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 09:43:53 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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
% 0.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2143208 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSS-FFMM21-DFFFFFNN
% 0.13/0.44 % partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.44 % SubtermCWHack with pid 2143216 completed with status 0
% 0.13/0.44 % Result found by SubtermCWHack
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSS-FFMM21-DFFFFFNN
% 0.13/0.44 % partial match(1): FGHSS-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Preprocessing time : 0.002 s
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Theorem
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 45
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 99
% 0.13/0.44 % Removed in clause preprocessing : 19
% 0.13/0.44 % Initial clauses in saturation : 80
% 0.13/0.44 % Processed clauses : 157
% 0.13/0.44 % ...of these trivial : 4
% 0.13/0.44 % ...subsumed : 44
% 0.13/0.44 % ...remaining for further processing : 109
% 0.13/0.44 % Other redundant clauses eliminated : 8
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 9
% 0.13/0.44 % Backward-rewritten : 32
% 0.13/0.44 % Generated clauses : 384
% 0.13/0.44 % ...of the previous two non-redundant : 224
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 0
% 0.13/0.44 % Paramodulations : 375
% 0.13/0.44 % Factorizations : 3
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 8
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 315
% 0.13/0.44 % ...of those cached : 297
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 64
% 0.13/0.44 % Positive orientable unit clauses : 18
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 8
% 0.13/0.44 % Non-unit-clauses : 38
% 0.13/0.44 % Current number of unprocessed clauses: 145
% 0.13/0.44 % ...number of literals in the above : 432
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 55
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 684
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 512
% 0.13/0.44 % Non-unit clause-clause subsumptions : 42
% 0.13/0.44 % Unit Clause-clause subsumption calls : 70
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 4
% 0.13/0.44 % BW rewrite match successes : 4
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 7506
% 0.13/0.44 % Search garbage collected termcells : 693
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.016 s
% 0.13/0.44 % System time : 0.003 s
% 0.13/0.44 % Total time : 0.019 s
% 0.13/0.44 % Maximum resident set size: 3688 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.055 s
% 0.13/0.44 % System time : 0.016 s
% 0.13/0.44 % Total time : 0.071 s
% 0.13/0.44 % Maximum resident set size: 4864 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------