TSTP Solution File: LCL947^10 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL947^10 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:54:56 EDT 2024
% Result : Theorem 1.44s 0.66s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of formulae : 55 ( 17 unt; 15 typ; 0 def)
% Number of atoms : 155 ( 8 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 528 ( 62 ~; 65 |; 5 &; 375 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 5 con; 0-5 aty)
% Number of variables : 90 ( 20 ^ 70 !; 0 ?; 90 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mworld > mworld > $o ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_28,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
eiw_di: $i > mworld > $o ).
thf(decl_33,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_35,type,
qmltpeq: $i > $i > mworld > $o ).
thf(decl_37,type,
subset: $i > $i > mworld > $o ).
thf(decl_38,type,
union: $i > $i > $i ).
thf(decl_57,type,
esk15_5: mworld > $i > mworld > $i > mworld > mworld ).
thf(decl_58,type,
esk16_0: mworld ).
thf(decl_59,type,
esk17_0: $i ).
thf(decl_60,type,
esk18_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
! [X7: $i] :
( ( eiw_di @ X7 @ X3 )
=> ( X8 @ X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_di_def) ).
thf(subset_union,axiom,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X25: $i] :
( mbox
@ ( mforall_di
@ ^ [X14: $i] : ( mbox @ ( mimplies @ ( mbox @ ( subset @ X25 @ X14 ) ) @ ( mbox @ ( qmltpeq @ ( union @ X25 @ X14 ) @ X14 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_union) ).
thf(prove_idempotency_of_union,conjecture,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X33: $i] : ( mbox @ ( qmltpeq @ ( union @ X33 @ X33 ) @ X33 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_idempotency_of_union) ).
thf(mrel_transitive,axiom,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( ( mrel @ X3 @ X5 )
& ( mrel @ X5 @ X6 ) )
=> ( mrel @ X3 @ X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_transitive) ).
thf(mrel_reflexive,axiom,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
thf(reflexivity_of_subset,axiom,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X31: $i] : ( mbox @ ( subset @ X31 @ X31 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subset) ).
thf(c_0_9,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_10,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_11,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_12,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X7: $i] :
( ( eiw_di @ X7 @ Z1 )
=> ( Z0 @ X7 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_13,plain,
! [X124: mworld] :
( ( mrel @ mactual @ X124 )
=> ! [X123: $i] :
( ( eiw_di @ X123 @ X124 )
=> ! [X122: mworld] :
( ( mrel @ X124 @ X122 )
=> ! [X121: $i] :
( ( eiw_di @ X121 @ X122 )
=> ! [X120: mworld] :
( ( mrel @ X122 @ X120 )
=> ( ! [X118: mworld] :
( ( mrel @ X120 @ X118 )
=> ( subset @ X123 @ X121 @ X118 ) )
=> ! [X119: mworld] :
( ( mrel @ X120 @ X119 )
=> ( qmltpeq @ ( union @ X123 @ X121 ) @ X121 @ X119 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_union]),c_0_9]),c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
~ ! [X203: mworld] :
( ( mrel @ mactual @ X203 )
=> ! [X202: $i] :
( ( eiw_di @ X202 @ X203 )
=> ! [X201: mworld] :
( ( mrel @ X203 @ X201 )
=> ( qmltpeq @ ( union @ X202 @ X202 ) @ X202 @ X201 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_idempotency_of_union])]),c_0_9]),c_0_11]),c_0_12]) ).
thf(c_0_15,plain,
! [X288: mworld,X289: $i,X290: mworld,X291: $i,X292: mworld,X294: mworld] :
( ( ( mrel @ X292 @ ( esk15_5 @ X288 @ X289 @ X290 @ X291 @ X292 ) )
| ~ ( mrel @ X292 @ X294 )
| ( qmltpeq @ ( union @ X289 @ X291 ) @ X291 @ X294 )
| ~ ( mrel @ X290 @ X292 )
| ~ ( eiw_di @ X291 @ X290 )
| ~ ( mrel @ X288 @ X290 )
| ~ ( eiw_di @ X289 @ X288 )
| ~ ( mrel @ mactual @ X288 ) )
& ( ~ ( subset @ X289 @ X291 @ ( esk15_5 @ X288 @ X289 @ X290 @ X291 @ X292 ) )
| ~ ( mrel @ X292 @ X294 )
| ( qmltpeq @ ( union @ X289 @ X291 ) @ X291 @ X294 )
| ~ ( mrel @ X290 @ X292 )
| ~ ( eiw_di @ X291 @ X290 )
| ~ ( mrel @ X288 @ X290 )
| ~ ( eiw_di @ X289 @ X288 )
| ~ ( mrel @ mactual @ X288 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])]) ).
thf(c_0_16,negated_conjecture,
( ( mrel @ mactual @ esk16_0 )
& ( eiw_di @ esk17_0 @ esk16_0 )
& ( mrel @ esk16_0 @ esk18_0 )
& ~ ( qmltpeq @ ( union @ esk17_0 @ esk17_0 ) @ esk17_0 @ esk18_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
thf(c_0_17,plain,
! [X205: mworld,X206: mworld,X207: mworld] :
( ~ ( mrel @ X205 @ X206 )
| ~ ( mrel @ X206 @ X207 )
| ( mrel @ X205 @ X207 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mrel_transitive])])]) ).
thf(c_0_18,plain,
! [X3: mworld,X34: mworld,X10: $i,X7: $i,X6: mworld,X5: mworld] :
( ( mrel @ X3 @ ( esk15_5 @ X5 @ X7 @ X6 @ X10 @ X3 ) )
| ( qmltpeq @ ( union @ X7 @ X10 ) @ X10 @ X34 )
| ~ ( mrel @ X3 @ X34 )
| ~ ( mrel @ X6 @ X3 )
| ~ ( eiw_di @ X10 @ X6 )
| ~ ( mrel @ X5 @ X6 )
| ~ ( eiw_di @ X7 @ X5 )
| ~ ( mrel @ mactual @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,negated_conjecture,
mrel @ esk16_0 @ esk18_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( mrel @ X3 @ X6 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( mrel @ X5 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
mrel @ mactual @ esk16_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_22,plain,
! [X204: mworld] : ( mrel @ X204 @ X204 ),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
thf(c_0_23,plain,
! [X176: mworld] :
( ( mrel @ mactual @ X176 )
=> ! [X175: $i] :
( ( eiw_di @ X175 @ X176 )
=> ! [X174: mworld] :
( ( mrel @ X176 @ X174 )
=> ( subset @ X175 @ X175 @ X174 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_of_subset]),c_0_9]),c_0_11]),c_0_12]) ).
thf(c_0_24,negated_conjecture,
! [X3: mworld,X10: $i,X7: $i,X5: mworld] :
( ( mrel @ esk16_0 @ ( esk15_5 @ X3 @ X7 @ X5 @ X10 @ esk16_0 ) )
| ( qmltpeq @ ( union @ X7 @ X10 ) @ X10 @ esk18_0 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( mrel @ X5 @ esk16_0 )
| ~ ( eiw_di @ X10 @ X5 )
| ~ ( eiw_di @ X7 @ X3 )
| ~ ( mrel @ X3 @ X5 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_25,negated_conjecture,
! [X3: mworld] :
( ( mrel @ X3 @ esk16_0 )
| ~ ( mrel @ X3 @ mactual ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_26,plain,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,plain,
! [X313: mworld,X314: $i,X315: mworld] :
( ~ ( mrel @ mactual @ X313 )
| ~ ( eiw_di @ X314 @ X313 )
| ~ ( mrel @ X313 @ X315 )
| ( subset @ X314 @ X314 @ X315 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
thf(c_0_28,negated_conjecture,
! [X10: $i,X7: $i,X3: mworld] :
( ( mrel @ esk16_0 @ ( esk15_5 @ esk16_0 @ X7 @ X3 @ X10 @ esk16_0 ) )
| ( qmltpeq @ ( union @ X7 @ X10 ) @ X10 @ esk18_0 )
| ~ ( mrel @ X3 @ esk16_0 )
| ~ ( eiw_di @ X7 @ esk16_0 )
| ~ ( mrel @ esk16_0 @ X3 )
| ~ ( eiw_di @ X10 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
thf(c_0_29,negated_conjecture,
eiw_di @ esk17_0 @ esk16_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_30,plain,
! [X3: mworld,X7: $i,X5: mworld] :
( ( subset @ X7 @ X7 @ X5 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( eiw_di @ X7 @ X3 )
| ~ ( mrel @ X3 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
! [X7: $i,X3: mworld] :
( ( mrel @ esk16_0 @ ( esk15_5 @ esk16_0 @ esk17_0 @ X3 @ X7 @ esk16_0 ) )
| ( qmltpeq @ ( union @ esk17_0 @ X7 ) @ X7 @ esk18_0 )
| ~ ( mrel @ X3 @ esk16_0 )
| ~ ( mrel @ esk16_0 @ X3 )
| ~ ( eiw_di @ X7 @ X3 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_32,plain,
! [X6: mworld,X34: mworld,X10: $i,X7: $i,X5: mworld,X3: mworld] :
( ( qmltpeq @ ( union @ X7 @ X10 ) @ X10 @ X34 )
| ~ ( subset @ X7 @ X10 @ ( esk15_5 @ X3 @ X7 @ X5 @ X10 @ X6 ) )
| ~ ( mrel @ X6 @ X34 )
| ~ ( mrel @ X5 @ X6 )
| ~ ( eiw_di @ X10 @ X5 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( eiw_di @ X7 @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_33,negated_conjecture,
! [X3: mworld] :
( ( subset @ esk17_0 @ esk17_0 @ X3 )
| ~ ( mrel @ esk16_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_21])]) ).
thf(c_0_34,negated_conjecture,
! [X7: $i] :
( ( mrel @ esk16_0 @ ( esk15_5 @ esk16_0 @ esk17_0 @ esk16_0 @ X7 @ esk16_0 ) )
| ( qmltpeq @ ( union @ esk17_0 @ X7 ) @ X7 @ esk18_0 )
| ~ ( eiw_di @ X7 @ esk16_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_26])]) ).
thf(c_0_35,negated_conjecture,
~ ( qmltpeq @ ( union @ esk17_0 @ esk17_0 ) @ esk17_0 @ esk18_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_36,negated_conjecture,
! [X3: mworld,X5: mworld,X34: mworld,X6: mworld] :
( ( qmltpeq @ ( union @ esk17_0 @ esk17_0 ) @ esk17_0 @ X3 )
| ~ ( mrel @ esk16_0 @ ( esk15_5 @ X5 @ esk17_0 @ X6 @ esk17_0 @ X34 ) )
| ~ ( mrel @ mactual @ X5 )
| ~ ( eiw_di @ esk17_0 @ X6 )
| ~ ( eiw_di @ esk17_0 @ X5 )
| ~ ( mrel @ X34 @ X3 )
| ~ ( mrel @ X6 @ X34 )
| ~ ( mrel @ X5 @ X6 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_37,negated_conjecture,
mrel @ esk16_0 @ ( esk15_5 @ esk16_0 @ esk17_0 @ esk16_0 @ esk17_0 @ esk16_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_35]) ).
thf(c_0_38,negated_conjecture,
! [X3: mworld] :
( ( qmltpeq @ ( union @ esk17_0 @ esk17_0 ) @ esk17_0 @ X3 )
| ~ ( mrel @ esk16_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21]),c_0_29]),c_0_26])]) ).
thf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL947^10 : TPTP v8.2.0. Released v8.1.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 03:05:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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
% 1.44/0.66 # Version: 3.1.0-ho
% 1.44/0.66 # Preprocessing class: HSMSSMSSMLLNHSN.
% 1.44/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.44/0.66 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.44/0.66 # Starting post_as_ho3 with 300s (1) cores
% 1.44/0.66 # Starting new_ho_12 with 300s (1) cores
% 1.44/0.66 # Starting new_bool_2 with 300s (1) cores
% 1.44/0.66 # new_ho_10_cnf2 with pid 30032 completed with status 0
% 1.44/0.66 # Result found by new_ho_10_cnf2
% 1.44/0.66 # Preprocessing class: HSMSSMSSMLLNHSN.
% 1.44/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.44/0.66 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.44/0.66 # No SInE strategy applied
% 1.44/0.66 # Search class: HGUNS-FSLS33-SHSSMFNN
% 1.44/0.66 # partial match(2): HGHNS-FSLF33-SHSSMFNN
% 1.44/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.44/0.66 # Starting new_ho_15 with 811s (1) cores
% 1.44/0.66 # Starting new_ho_10_cnf2 with 151s (1) cores
% 1.44/0.66 # Starting sh5l with 136s (1) cores
% 1.44/0.66 # Starting ehoh_best8_lambda with 136s (1) cores
% 1.44/0.66 # Starting new_bool_3 with 136s (1) cores
% 1.44/0.66 # sh5l with pid 30041 completed with status 0
% 1.44/0.66 # Result found by sh5l
% 1.44/0.66 # Preprocessing class: HSMSSMSSMLLNHSN.
% 1.44/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.44/0.66 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.44/0.66 # No SInE strategy applied
% 1.44/0.66 # Search class: HGUNS-FSLS33-SHSSMFNN
% 1.44/0.66 # partial match(2): HGHNS-FSLF33-SHSSMFNN
% 1.44/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.44/0.66 # Starting new_ho_15 with 811s (1) cores
% 1.44/0.66 # Starting new_ho_10_cnf2 with 151s (1) cores
% 1.44/0.66 # Starting sh5l with 136s (1) cores
% 1.44/0.66 # Preprocessing time : 0.006 s
% 1.44/0.66 # Presaturation interreduction done
% 1.44/0.66
% 1.44/0.66 # Proof found!
% 1.44/0.66 # SZS status Theorem
% 1.44/0.66 # SZS output start CNFRefutation
% See solution above
% 1.44/0.66 # Parsed axioms : 48
% 1.44/0.66 # Removed by relevancy pruning/SinE : 0
% 1.44/0.66 # Initial clauses : 110
% 1.44/0.66 # Removed in clause preprocessing : 18
% 1.44/0.66 # Initial clauses in saturation : 92
% 1.44/0.66 # Processed clauses : 293
% 1.44/0.66 # ...of these trivial : 0
% 1.44/0.66 # ...subsumed : 26
% 1.44/0.66 # ...remaining for further processing : 267
% 1.44/0.66 # Other redundant clauses eliminated : 0
% 1.44/0.66 # Clauses deleted for lack of memory : 0
% 1.44/0.66 # Backward-subsumed : 0
% 1.44/0.66 # Backward-rewritten : 0
% 1.44/0.66 # Generated clauses : 1394
% 1.44/0.66 # ...of the previous two non-redundant : 1392
% 1.44/0.66 # ...aggressively subsumed : 0
% 1.44/0.66 # Contextual simplify-reflections : 0
% 1.44/0.66 # Paramodulations : 1394
% 1.44/0.66 # Factorizations : 0
% 1.44/0.66 # NegExts : 0
% 1.44/0.66 # Equation resolutions : 0
% 1.44/0.66 # Disequality decompositions : 0
% 1.44/0.66 # Total rewrite steps : 26
% 1.44/0.66 # ...of those cached : 21
% 1.44/0.66 # Propositional unsat checks : 0
% 1.44/0.66 # Propositional check models : 0
% 1.44/0.66 # Propositional check unsatisfiable : 0
% 1.44/0.66 # Propositional clauses : 0
% 1.44/0.66 # Propositional clauses after purity: 0
% 1.44/0.66 # Propositional unsat core size : 0
% 1.44/0.66 # Propositional preprocessing time : 0.000
% 1.44/0.66 # Propositional encoding time : 0.000
% 1.44/0.66 # Propositional solver time : 0.000
% 1.44/0.66 # Success case prop preproc time : 0.000
% 1.44/0.66 # Success case prop encoding time : 0.000
% 1.44/0.66 # Success case prop solver time : 0.000
% 1.44/0.66 # Current number of processed clauses : 175
% 1.44/0.66 # Positive orientable unit clauses : 6
% 1.44/0.66 # Positive unorientable unit clauses: 0
% 1.44/0.66 # Negative unit clauses : 1
% 1.44/0.66 # Non-unit-clauses : 168
% 1.44/0.66 # Current number of unprocessed clauses: 1265
% 1.44/0.66 # ...number of literals in the above : 11535
% 1.44/0.66 # Current number of archived formulas : 0
% 1.44/0.66 # Current number of archived clauses : 92
% 1.44/0.66 # Clause-clause subsumption calls (NU) : 9893
% 1.44/0.66 # Rec. Clause-clause subsumption calls : 1537
% 1.44/0.66 # Non-unit clause-clause subsumptions : 26
% 1.44/0.66 # Unit Clause-clause subsumption calls : 7
% 1.44/0.66 # Rewrite failures with RHS unbound : 0
% 1.44/0.66 # BW rewrite match attempts : 7
% 1.44/0.66 # BW rewrite match successes : 0
% 1.44/0.66 # Condensation attempts : 293
% 1.44/0.66 # Condensation successes : 0
% 1.44/0.66 # Termbank termtop insertions : 236079
% 1.44/0.66 # Search garbage collected termcells : 10842
% 1.44/0.66
% 1.44/0.66 # -------------------------------------------------
% 1.44/0.66 # User time : 0.150 s
% 1.44/0.66 # System time : 0.008 s
% 1.44/0.66 # Total time : 0.158 s
% 1.44/0.66 # Maximum resident set size: 3420 pages
% 1.44/0.66
% 1.44/0.66 # -------------------------------------------------
% 1.44/0.66 # User time : 0.659 s
% 1.44/0.66 # System time : 0.046 s
% 1.44/0.66 # Total time : 0.705 s
% 1.44/0.66 # Maximum resident set size: 1796 pages
% 1.44/0.66 % E---3.1 exiting
% 1.44/0.66 % E exiting
%------------------------------------------------------------------------------