TSTP Solution File: SWW101+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWW101+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:10:40 EDT 2023
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 13
% Syntax : Number of formulae : 80 ( 29 unt; 0 def)
% Number of atoms : 254 ( 114 equ)
% Maximal formula atoms : 75 ( 3 avg)
% Number of connectives : 260 ( 86 ~; 123 |; 45 &)
% ( 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 : 57 ( 8 sgn; 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(def_forallprefers,axiom,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( ~ d(X1)
& d(X2) )
| ( d(X1)
& d(X2)
& ~ bool(X1)
& bool(X2) )
| ( X1 = false
& X2 = true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',def_forallprefers) ).
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',prop_false) ).
fof(def_phi,axiom,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',def_phi) ).
fof(def_false2,axiom,
? [X5] :
( false2 = phi(f7(X5))
& ~ ? [X10] : forallprefers(f7(X10),f7(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',def_false2) ).
fof(def_f7,axiom,
! [X5] : f7(X5) = lazy_impl(prop(X5),X5),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',def_f7) ).
fof(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',lazy_impl_axiom2) ).
fof(false_true_err_in_d,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',false_true_err_in_d) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = false
| X1 = true ) ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',def_bool) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',prop_true) ).
fof(lazy_impl_axiom3,axiom,
! [X4] : lazy_impl(true,X4) = phi(X4),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',lazy_impl_axiom3) ).
fof(false1_false2,conjecture,
false1 = false2,
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',false1_false2) ).
fof(def_false1,axiom,
false1 = false,
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',def_false1) ).
fof(distinct_false_true_err,axiom,
( true != false
& true != err
& false != err ),
file('/export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p',distinct_false_true_err) ).
fof(c_0_13,plain,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( ~ d(X1)
& d(X2) )
| ( d(X1)
& d(X2)
& ~ bool(X1)
& bool(X2) )
| ( X1 = false
& X2 = true ) ) ),
inference(fof_simplification,[status(thm)],[def_forallprefers]) ).
fof(c_0_14,plain,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
inference(fof_simplification,[status(thm)],[prop_false]) ).
fof(c_0_15,plain,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
inference(fof_simplification,[status(thm)],[def_phi]) ).
fof(c_0_16,plain,
! [X12] :
( false2 = phi(f7(esk1_0))
& ~ forallprefers(f7(X12),f7(esk1_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])]) ).
fof(c_0_17,plain,
! [X14,X15] :
( ( X14 = false
| d(X14)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| d(X14)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X14 = false
| d(X15)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| d(X15)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X14 = false
| ~ bool(X14)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| ~ bool(X14)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X14 = false
| bool(X15)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| bool(X15)
| ~ d(X14)
| ~ forallprefers(X14,X15) )
& ( X14 = false
| d(X14)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| d(X14)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( X14 = false
| d(X15)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| d(X15)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( X14 = false
| ~ bool(X14)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| ~ bool(X14)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( X14 = false
| bool(X15)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( X15 = true
| bool(X15)
| d(X15)
| ~ forallprefers(X14,X15) )
& ( d(X14)
| ~ d(X15)
| forallprefers(X14,X15) )
& ( ~ d(X14)
| ~ d(X15)
| bool(X14)
| ~ bool(X15)
| forallprefers(X14,X15) )
& ( X14 != false
| X15 != true
| forallprefers(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_18,plain,
! [X20] : f7(X20) = lazy_impl(prop(X20),X20),
inference(variable_rename,[status(thm)],[def_f7]) ).
fof(c_0_19,plain,
! [X53] :
( ( prop(X53) != false
| ~ bool(X53) )
& ( bool(X53)
| prop(X53) = false ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
fof(c_0_20,plain,
! [X54] : lazy_impl(false,X54) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
fof(c_0_21,plain,
! [X64] :
( ( ~ d(X64)
| d(X64) )
& ( phi(X64) = err
| d(X64) )
& ( ~ d(X64)
| phi(X64) = X64 )
& ( phi(X64) = err
| phi(X64) = X64 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_22,plain,
~ forallprefers(f7(X1),f7(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( d(X1)
| forallprefers(X1,X2)
| ~ d(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( bool(X1)
| prop(X1) = false ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
false2 = phi(f7(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( phi(X1) = X1
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( d(f7(X1))
| ~ d(f7(esk1_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( f7(X1) = true
| bool(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_32,plain,
( f7(esk1_0) = false2
| ~ d(f7(esk1_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( d(f7(X1))
| bool(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
fof(c_0_34,plain,
! [X52] :
( ( ~ bool(X52)
| X52 = false
| X52 = true )
& ( X52 != false
| bool(X52) )
& ( X52 != true
| bool(X52) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])]) ).
cnf(c_0_35,plain,
( f7(esk1_0) = false2
| bool(esk1_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_37,plain,
( false2 = true
| bool(esk1_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
fof(c_0_38,plain,
! [X58] :
( ( prop(X58) != true
| bool(X58) )
& ( ~ bool(X58)
| prop(X58) = true ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])]) ).
fof(c_0_39,plain,
! [X27] : lazy_impl(true,X27) = phi(X27),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
cnf(c_0_40,plain,
( false2 = true
| esk1_0 = true
| esk1_0 = false ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( prop(X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,plain,
( bool(X1)
| X1 != true ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( phi(f7(true)) = false2
| esk1_0 = false
| false2 = true ),
inference(spm,[status(thm)],[c_0_27,c_0_40]) ).
cnf(c_0_45,plain,
( f7(X1) = phi(X1)
| ~ bool(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_41]),c_0_42]) ).
cnf(c_0_46,plain,
bool(true),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,plain,
( phi(phi(true)) = false2
| false2 = true
| esk1_0 = false ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_48,plain,
( phi(true) = false2
| esk1_0 = false
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_28]),c_0_31])]) ).
cnf(c_0_49,plain,
( esk1_0 = false
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_48]),c_0_31])]) ).
cnf(c_0_50,plain,
( bool(X1)
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,plain,
( phi(f7(false)) = false2
| false2 = true ),
inference(spm,[status(thm)],[c_0_27,c_0_49]) ).
cnf(c_0_52,plain,
bool(false),
inference(er,[status(thm)],[c_0_50]) ).
fof(c_0_53,negated_conjecture,
false1 != false2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[false1_false2])]) ).
cnf(c_0_54,plain,
( phi(phi(false)) = false2
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_52])]) ).
cnf(c_0_55,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_56,negated_conjecture,
false1 != false2,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,plain,
false1 = false,
inference(split_conjunct,[status(thm)],[def_false1]) ).
cnf(c_0_58,plain,
( bool(X1)
| forallprefers(X1,X2)
| ~ d(X1)
| ~ d(X2)
| ~ bool(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_59,plain,
( phi(X1) = err
| phi(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_60,plain,
( phi(false) = false2
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_28]),c_0_55])]) ).
cnf(c_0_61,negated_conjecture,
false2 != false,
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( forallprefers(X1,X2)
| bool(X1)
| ~ d(X2)
| ~ bool(X2) ),
inference(csr,[status(thm)],[c_0_58,c_0_23]) ).
cnf(c_0_63,plain,
( f7(esk1_0) = false2
| false2 = err ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_59]),c_0_27]) ).
cnf(c_0_64,plain,
false2 = true,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_60]),c_0_55])]),c_0_61]) ).
cnf(c_0_65,plain,
true != err,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_66,plain,
( bool(f7(X1))
| ~ d(f7(esk1_0))
| ~ bool(f7(esk1_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_62]) ).
cnf(c_0_67,plain,
f7(esk1_0) = true,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_64]),c_0_65]) ).
cnf(c_0_68,plain,
bool(f7(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_31]),c_0_67]),c_0_46])]) ).
cnf(c_0_69,plain,
( forallprefers(X1,X2)
| X1 != false
| X2 != true ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_70,plain,
( false2 = err
| ~ forallprefers(f7(X1),false2) ),
inference(spm,[status(thm)],[c_0_22,c_0_63]) ).
cnf(c_0_71,plain,
( f7(X1) = true
| f7(X1) = false ),
inference(spm,[status(thm)],[c_0_36,c_0_68]) ).
cnf(c_0_72,plain,
( forallprefers(X1,true)
| X1 != false ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_73,plain,
~ forallprefers(f7(X1),true),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_64]),c_0_64]),c_0_65]) ).
cnf(c_0_74,plain,
( f7(X1) = false
| phi(X1) = true
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_71]) ).
cnf(c_0_75,plain,
forallprefers(false,true),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_76,plain,
( phi(X1) = true
| ~ bool(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_77,plain,
( true = X1
| ~ bool(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_76]),c_0_65]) ).
cnf(c_0_78,plain,
true != false,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_79,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_52]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWW101+1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 22:57:37 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.BO5nB1OsvB/E---3.1_15055.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # sh5l with pid 15136 completed with status 0
% 0.15/0.44 # Result found by sh5l
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.44 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.44 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 15139 completed with status 0
% 0.15/0.44 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.44 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.44 # Preprocessing time : 0.002 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 45
% 0.15/0.44 # Removed by relevancy pruning/SinE : 0
% 0.15/0.44 # Initial clauses : 99
% 0.15/0.44 # Removed in clause preprocessing : 5
% 0.15/0.44 # Initial clauses in saturation : 94
% 0.15/0.44 # Processed clauses : 293
% 0.15/0.44 # ...of these trivial : 8
% 0.15/0.44 # ...subsumed : 58
% 0.15/0.44 # ...remaining for further processing : 227
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 18
% 0.15/0.44 # Backward-rewritten : 32
% 0.15/0.44 # Generated clauses : 430
% 0.15/0.44 # ...of the previous two non-redundant : 348
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 4
% 0.15/0.44 # Paramodulations : 417
% 0.15/0.44 # Factorizations : 5
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 8
% 0.15/0.44 # Total rewrite steps : 173
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 101
% 0.15/0.44 # Positive orientable unit clauses : 33
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 12
% 0.15/0.44 # Non-unit-clauses : 56
% 0.15/0.44 # Current number of unprocessed clauses: 203
% 0.15/0.44 # ...number of literals in the above : 514
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 126
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 1008
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 760
% 0.15/0.44 # Non-unit clause-clause subsumptions : 64
% 0.15/0.44 # Unit Clause-clause subsumption calls : 182
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 5
% 0.15/0.44 # BW rewrite match successes : 5
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 7651
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.015 s
% 0.15/0.44 # System time : 0.002 s
% 0.15/0.44 # Total time : 0.017 s
% 0.15/0.44 # Maximum resident set size: 1940 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.017 s
% 0.15/0.44 # System time : 0.004 s
% 0.15/0.44 # Total time : 0.021 s
% 0.15/0.44 # Maximum resident set size: 1724 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------