%------------------------------------------------------------------------------
% File : E---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 : n019.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:10:00 PM UTC 2026
% Result : Theorem 0.08s 0.44s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 73 ( 28 unt; 0 def)
% Number of atoms : 237 ( 89 equ)
% Maximal formula atoms : 75 ( 3 avg)
% Number of connectives : 256 ( 92 ~; 115 |; 43 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 3 avg)
% Maximal term depth : 3 ( 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 : 52 ( 9 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_false) ).
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_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_true) ).
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(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
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_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(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(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(false1_false2,conjecture,
false1 = false2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',false1_false2) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = true
| X1 = false ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_bool) ).
fof(def_false1,axiom,
false1 = false,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_false1) ).
fof(c_0_12,plain,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
inference(fof_simplification,[status(thm)],[prop_false]) ).
fof(c_0_13,plain,
! [X20] : f7(X20) = lazy_impl(prop(X20),X20),
inference(variable_rename,[status(thm)],[def_f7]) ).
fof(c_0_14,plain,
! [X58] :
( ( prop(X58) = true
| ~ bool(X58) )
& ( bool(X58)
| prop(X58) != true ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])])]) ).
fof(c_0_15,plain,
! [X27] : lazy_impl(true,X27) = phi(X27),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_16,plain,
! [X53] :
( ( prop(X53) = false
| bool(X53) )
& ( ~ bool(X53)
| prop(X53) != false ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_17,plain,
! [X54] : lazy_impl(false,X54) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
fof(c_0_18,plain,
! [X12] :
( ~ forallprefers(f7(X12),f7(esk1_0))
& false2 = phi(f7(esk1_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])])])])]) ).
cnf(c_0_19,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ bool(X1)
| prop(X1) = true ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X1] :
( ( phi(X1) = err
& ~ d(X1) )
| ( phi(X1) = X1
& d(X1) ) ),
inference(fof_simplification,[status(thm)],[def_phi]) ).
cnf(c_0_23,plain,
( prop(X1) = false
| bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,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_26,plain,
~ forallprefers(f7(X1),f7(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ bool(X1)
| f7(X1) = phi(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
fof(c_0_28,plain,
! [X64] :
( ( phi(X64) = X64
| phi(X64) = err )
& ( phi(X64) = X64
| ~ d(X64) )
& ( d(X64)
| phi(X64) = err )
& ( d(X64)
| ~ d(X64) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])])]) ).
cnf(c_0_29,plain,
( bool(X1)
| f7(X1) = true ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_24]) ).
fof(c_0_30,plain,
! [X14,X15] :
( ( forallprefers(X14,X15)
| X15 != true
| X14 != false )
& ( forallprefers(X14,X15)
| ~ bool(X15)
| bool(X14)
| ~ d(X15)
| ~ d(X14) )
& ( forallprefers(X14,X15)
| ~ d(X15)
| d(X14) )
& ( ~ forallprefers(X14,X15)
| d(X15)
| bool(X15)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| d(X15)
| bool(X15)
| X14 = false )
& ( ~ forallprefers(X14,X15)
| d(X15)
| ~ bool(X14)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| d(X15)
| ~ bool(X14)
| X14 = false )
& ( ~ forallprefers(X14,X15)
| d(X15)
| d(X15)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| d(X15)
| d(X15)
| X14 = false )
& ( ~ forallprefers(X14,X15)
| d(X15)
| d(X14)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| d(X15)
| d(X14)
| X14 = false )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| bool(X15)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| bool(X15)
| X14 = false )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| ~ bool(X14)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| ~ bool(X14)
| X14 = false )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| d(X15)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| d(X15)
| X14 = false )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| d(X14)
| X15 = true )
& ( ~ forallprefers(X14,X15)
| ~ d(X14)
| d(X14)
| X14 = false ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_31,plain,
( ~ bool(esk1_0)
| ~ forallprefers(f7(X1),phi(esk1_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( d(X1)
| phi(X1) = err ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( ~ forallprefers(f7(X1),true)
| bool(esk1_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_34,plain,
( ~ d(X2)
| forallprefers(X1,X2)
| d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_36,plain,
false2 = phi(f7(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_37,plain,
( ~ d(X1)
| phi(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( ~ bool(esk1_0)
| ~ forallprefers(f7(X1),err)
| d(esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
d(err),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_40,plain,
( bool(esk1_0)
| d(f7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_41,plain,
( ~ bool(esk1_0)
| phi(phi(esk1_0)) = false2 ),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
fof(c_0_42,negated_conjecture,
false1 != false2,
inference(assume_negation,[status(cth)],[false1_false2]) ).
cnf(c_0_43,plain,
( ~ bool(esk1_0)
| ~ d(esk1_0)
| ~ forallprefers(f7(X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_44,plain,
( d(esk1_0)
| d(f7(X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_39])]),c_0_40]) ).
cnf(c_0_45,plain,
( ~ bool(esk1_0)
| ~ d(esk1_0)
| phi(esk1_0) = false2 ),
inference(spm,[status(thm)],[c_0_41,c_0_37]) ).
cnf(c_0_46,plain,
( bool(esk1_0)
| phi(true) = false2 ),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
fof(c_0_47,plain,
! [X52] :
( ( bool(X52)
| X52 != true )
& ( bool(X52)
| X52 != false )
& ( X52 = true
| X52 = false
| ~ bool(X52) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])])]) ).
fof(c_0_48,negated_conjecture,
false1 != false2,
inference(fof_simplification,[status(thm)],[c_0_42]) ).
cnf(c_0_49,plain,
( ~ d(f7(esk1_0))
| f7(esk1_0) = false2 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_50,plain,
d(f7(X1)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_40]),c_0_44]) ).
cnf(c_0_51,plain,
( ~ bool(esk1_0)
| ~ d(esk1_0)
| esk1_0 = false2 ),
inference(spm,[status(thm)],[c_0_37,c_0_45]) ).
cnf(c_0_52,plain,
( bool(esk1_0)
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_46]),c_0_35])]) ).
cnf(c_0_53,plain,
( ~ bool(X1)
| X1 = true
| X1 = false ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_54,negated_conjecture,
false1 != false2,
inference(fof_nnf,[status(thm)],[c_0_48]) ).
cnf(c_0_55,plain,
( ~ bool(X1)
| ~ forallprefers(phi(X1),f7(esk1_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_56,plain,
f7(esk1_0) = false2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_57,plain,
( ~ d(esk1_0)
| esk1_0 = false2
| false2 = true ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( esk1_0 = true
| esk1_0 = false
| false2 = true ),
inference(spm,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
false1 != false2,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,plain,
false1 = false,
inference(split_conjunct,[status(thm)],[def_false1]) ).
cnf(c_0_61,plain,
( ~ bool(X1)
| ~ forallprefers(phi(X1),false2) ),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( false2 = true
| esk1_0 = false ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_35])]) ).
cnf(c_0_63,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_64,negated_conjecture,
false2 != false,
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
( ~ bool(X1)
| ~ d(X1)
| ~ forallprefers(X1,false2) ),
inference(spm,[status(thm)],[c_0_61,c_0_37]) ).
cnf(c_0_66,plain,
false2 = true,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_62]),c_0_63])]),c_0_64]) ).
cnf(c_0_67,plain,
( X2 != true
| X1 != false
| forallprefers(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_68,plain,
( X1 != false
| bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_69,plain,
( ~ bool(X1)
| ~ d(X1)
| ~ forallprefers(X1,true) ),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
forallprefers(false,true),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_67])]) ).
cnf(c_0_71,plain,
bool(false),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_72,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_63]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW101+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n019.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 09:39:19 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/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.08/0.44 % Version: 3.5.1
% 0.08/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.44 % Starting sh5l with 300s (1) cores
% 0.08/0.44 % sh5l with pid 2259571 completed with status 0
% 0.08/0.44 % Result found by sh5l
% 0.08/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.44 % Starting sh5l with 300s (1) cores
% 0.08/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.44 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.08/0.44 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.44 % SubtermCWHack with pid 2259575 completed with status 0
% 0.08/0.44 % Result found by SubtermCWHack
% 0.08/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.44 % Starting sh5l with 300s (1) cores
% 0.08/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.44 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.08/0.44 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.44 % Preprocessing time : 0.001 s
% 0.08/0.44
% 0.08/0.44 % Proof found!
% 0.08/0.44 % SZS status Theorem
% 0.08/0.44 % SZS output start CNFRefutation
% See solution above
% 0.08/0.44 % Parsed axioms : 45
% 0.08/0.44 % Removed by relevancy pruning/SinE : 0
% 0.08/0.44 % Initial clauses : 99
% 0.08/0.44 % Removed in clause preprocessing : 5
% 0.08/0.44 % Initial clauses in saturation : 94
% 0.08/0.44 % Processed clauses : 292
% 0.08/0.44 % ...of these trivial : 5
% 0.08/0.44 % ...subsumed : 125
% 0.08/0.44 % ...remaining for further processing : 162
% 0.08/0.44 % Other redundant clauses eliminated : 8
% 0.08/0.44 % Clauses deleted for lack of memory : 0
% 0.08/0.44 % Backward-subsumed : 39
% 0.08/0.44 % Backward-rewritten : 43
% 0.08/0.44 % Generated clauses : 514
% 0.08/0.44 % ...of the previous two non-redundant : 395
% 0.08/0.44 % ...aggressively subsumed : 0
% 0.08/0.44 % Contextual simplify-reflections : 7
% 0.08/0.44 % Paramodulations : 505
% 0.08/0.44 % Factorizations : 3
% 0.08/0.44 % NegExts : 0
% 0.08/0.44 % Equation resolutions : 8
% 0.08/0.44 % Disequality decompositions : 0
% 0.08/0.44 % Total rewrite steps : 248
% 0.08/0.44 % ...of those cached : 232
% 0.08/0.44 % Propositional unsat checks : 0
% 0.08/0.44 % Propositional check models : 0
% 0.08/0.44 % Propositional check unsatisfiable : 0
% 0.08/0.44 % Propositional clauses : 0
% 0.08/0.44 % Propositional clauses after purity: 0
% 0.08/0.44 % Propositional unsat core size : 0
% 0.08/0.44 % Propositional preprocessing time : 0.000
% 0.08/0.44 % Propositional encoding time : 0.000
% 0.08/0.44 % Propositional solver time : 0.000
% 0.08/0.44 % Success case prop preproc time : 0.000
% 0.08/0.44 % Success case prop encoding time : 0.000
% 0.08/0.44 % Success case prop solver time : 0.000
% 0.08/0.44 % Current number of processed clauses : 76
% 0.08/0.44 % Positive orientable unit clauses : 23
% 0.08/0.44 % Positive unorientable unit clauses: 0
% 0.08/0.44 % Negative unit clauses : 7
% 0.08/0.44 % Non-unit-clauses : 46
% 0.08/0.44 % Current number of unprocessed clauses: 137
% 0.08/0.44 % ...number of literals in the above : 408
% 0.08/0.44 % Current number of archived formulas : 0
% 0.08/0.44 % Current number of archived clauses : 82
% 0.08/0.44 % Clause-clause subsumption calls (NU) : 1144
% 0.08/0.44 % Rec. Clause-clause subsumption calls : 972
% 0.08/0.44 % Non-unit clause-clause subsumptions : 108
% 0.08/0.44 % Unit Clause-clause subsumption calls : 117
% 0.08/0.44 % Rewrite failures with RHS unbound : 0
% 0.08/0.44 % BW rewrite match attempts : 6
% 0.08/0.44 % BW rewrite match successes : 6
% 0.08/0.44 % Condensation attempts : 0
% 0.08/0.44 % Condensation successes : 0
% 0.08/0.44 % Termbank termtop insertions : 8526
% 0.08/0.44 % Search garbage collected termcells : 687
% 0.08/0.44
% 0.08/0.44 % -------------------------------------------------
% 0.08/0.44 % User time : 0.013 s
% 0.08/0.44 % System time : 0.001 s
% 0.08/0.44 % Total time : 0.015 s
% 0.08/0.44 % Maximum resident set size: 3944 pages
% 0.08/0.44
% 0.08/0.44 % -------------------------------------------------
% 0.08/0.44 % User time : 0.014 s
% 0.08/0.44 % System time : 0.007 s
% 0.08/0.44 % Total time : 0.021 s
% 0.08/0.44 % Maximum resident set size: 4608 pages
% 0.08/0.44 % E exiting
%------------------------------------------------------------------------------