TSTP Solution File: SEV086^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV086^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Tue May 21 04:07:33 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 227 ( 14 equ; 0 cnn)
% Maximal formula atoms : 72 ( 8 avg)
% Number of connectives : 505 ( 53 ~; 64 |; 19 &; 362 @)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 101 ( 101 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 ^ 27 !; 2 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_23,type,
epred2_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_24,type,
epred3_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_25,type,
epred4_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_26,type,
epred5_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_27,type,
epred6_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(decl_28,type,
esk1_1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i ).
thf(cTHM120I_pme,conjecture,
? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ! [X2: $i > $o] : ( X1 @ X2 @ X2 )
& ! [X2: $i > $o,X3: $i > $o,X4: $i > $o] :
( ( ( X1 @ X2 @ X3 )
& ( X1 @ X3 @ X4 ) )
=> ( X1 @ X2 @ X4 ) )
& ! [X5: $i > $o,X6: $i > $o] :
( ( ( X1 @ X5 @ X6 )
& ( X1 @ X6 @ X5 ) )
=> ! [X7: $i] :
( ( X5 @ X7 )
<=> ( X6 @ X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM120I_pme) ).
thf(c_0_1,negated_conjecture,
~ ? [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ! [X2: $i > $o] : ( X1 @ X2 @ X2 )
& ! [X2: $i > $o,X3: $i > $o,X4: $i > $o] :
( ( ( X1 @ X2 @ X3 )
& ( X1 @ X3 @ X4 ) )
=> ( X1 @ X2 @ X4 ) )
& ! [X5: $i > $o,X6: $i > $o] :
( ( ( X1 @ X5 @ X6 )
& ( X1 @ X6 @ X5 ) )
=> ! [X7: $i] :
( ( X5 @ X7 )
<=> ( X6 @ X7 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM120I_pme]) ).
thf(c_0_2,negated_conjecture,
! [X16: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X16 @ ( epred5_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ( X16 @ ( epred2_1 @ X16 ) @ ( epred3_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( X16 @ ( epred6_1 @ X16 ) @ ( epred5_1 @ X16 ) )
| ( X16 @ ( epred2_1 @ X16 ) @ ( epred3_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ~ ( epred5_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( epred6_1 @ X16 @ ( esk1_1 @ X16 ) )
| ( X16 @ ( epred2_1 @ X16 ) @ ( epred3_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( epred5_1 @ X16 @ ( esk1_1 @ X16 ) )
| ( epred6_1 @ X16 @ ( esk1_1 @ X16 ) )
| ( X16 @ ( epred2_1 @ X16 ) @ ( epred3_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( X16 @ ( epred5_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ( X16 @ ( epred3_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( X16 @ ( epred6_1 @ X16 ) @ ( epred5_1 @ X16 ) )
| ( X16 @ ( epred3_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ~ ( epred5_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( epred6_1 @ X16 @ ( esk1_1 @ X16 ) )
| ( X16 @ ( epred3_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( epred5_1 @ X16 @ ( esk1_1 @ X16 ) )
| ( epred6_1 @ X16 @ ( esk1_1 @ X16 ) )
| ( X16 @ ( epred3_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( X16 @ ( epred5_1 @ X16 ) @ ( epred6_1 @ X16 ) )
| ~ ( X16 @ ( epred2_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( X16 @ ( epred6_1 @ X16 ) @ ( epred5_1 @ X16 ) )
| ~ ( X16 @ ( epred2_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ~ ( epred5_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( epred6_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred2_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) )
& ( ( epred5_1 @ X16 @ ( esk1_1 @ X16 ) )
| ( epred6_1 @ X16 @ ( esk1_1 @ X16 ) )
| ~ ( X16 @ ( epred2_1 @ X16 ) @ ( epred4_1 @ X16 ) )
| ~ ( X16 @ ( epred1_1 @ X16 ) @ ( epred1_1 @ X16 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred5_1 @ X1 ) @ ( epred6_1 @ X1 ) )
| ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( ( epred6_1 @ $eq )
= ( epred5_1 @ $eq ) )
| ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( ( epred6_1 @ $eq )
= ( epred5_1 @ $eq ) )
| ( ( epred4_1 @ $eq )
= ( epred3_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( ( epred6_1 @ $eq )
= ( epred5_1 @ $eq ) )
| ( ( epred2_1 @ $eq )
= ( epred3_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( epred6_1 @ $eq )
= ( epred5_1 @ $eq ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( epred5_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( epred6_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X49: $i] :
( ( epred6_1 @ $eq @ X49 )
<=> ( epred5_1 @ $eq @ X49 ) ),
inference(arg_cong,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) )
| ~ ( epred5_1 @ $eq @ ( esk1_1 @ $eq ) )
| ~ ( epred6_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X7: $i] :
( ( epred6_1 @ $eq @ X7 )
| ~ ( epred5_1 @ $eq @ X7 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ~ ( epred5_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( epred6_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( epred5_1 @ X1 @ ( esk1_1 @ X1 ) )
| ( epred6_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred2_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
! [X7: $i] :
( ( epred5_1 @ $eq @ X7 )
| ~ ( epred6_1 @ $eq @ X7 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
( ( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) )
| ~ ( epred5_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_18,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( epred5_1 @ X1 @ ( esk1_1 @ X1 ) )
| ( epred6_1 @ X1 @ ( esk1_1 @ X1 ) )
| ( X1 @ ( epred2_1 @ X1 ) @ ( epred3_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,negated_conjecture,
( ( ( epred2_1 @ $eq )
= ( epred3_1 @ $eq ) )
| ~ ( epred5_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_14]),c_0_13]) ).
thf(c_0_20,negated_conjecture,
( ( epred4_1 @ $eq )
!= ( epred2_1 @ $eq ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_15]),c_0_16]),c_0_17]) ).
thf(c_0_21,negated_conjecture,
( ( epred2_1 @ $eq )
= ( epred3_1 @ $eq ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_18]),c_0_16]),c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( epred5_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( epred6_1 @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_23,negated_conjecture,
! [X1: ( $i > $o ) > ( $i > $o ) > $o] :
( ( epred5_1 @ X1 @ ( esk1_1 @ X1 ) )
| ( epred6_1 @ X1 @ ( esk1_1 @ X1 ) )
| ( X1 @ ( epred3_1 @ X1 ) @ ( epred4_1 @ X1 ) )
| ~ ( X1 @ ( epred1_1 @ X1 ) @ ( epred1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_24,negated_conjecture,
( ( epred4_1 @ $eq )
!= ( epred3_1 @ $eq ) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_25,negated_conjecture,
( ( ( epred4_1 @ $eq )
= ( epred3_1 @ $eq ) )
| ~ ( epred5_1 @ $eq @ ( esk1_1 @ $eq ) ) ),
inference(csr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_22]),c_0_13]) ).
thf(c_0_26,negated_conjecture,
epred5_1 @ $eq @ ( esk1_1 @ $eq ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_23]),c_0_24]),c_0_16]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV086^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 18:40:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.51 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting sh2lt with 1200s (4) cores
% 0.21/0.51 # Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51 # Starting ehoh_best3_rw with 300s (1) cores
% 0.21/0.51 # sh2lt with pid 30717 completed with status 0
% 0.21/0.51 # Result found by sh2lt
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.51 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting sh2lt with 1200s (4) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.51 # Search class: HGHNF-FFSF11-SHHFFMBN
% 0.21/0.51 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.21/0.51 # Starting ehoh_best_nonlift with 649s (1) cores
% 0.21/0.51 # Starting sh2lt with 121s (1) cores
% 0.21/0.51 # Starting ehoh_best_sine_rwall with 109s (1) cores
% 0.21/0.51 # Starting lpo1_def_fix with 109s (1) cores
% 0.21/0.51 # sh2lt with pid 30725 completed with status 0
% 0.21/0.51 # Result found by sh2lt
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.51 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting sh2lt with 1200s (4) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.21/0.51 # Search class: HGHNF-FFSF11-SHHFFMBN
% 0.21/0.51 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.21/0.51 # Starting ehoh_best_nonlift with 649s (1) cores
% 0.21/0.51 # Starting sh2lt with 121s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 1
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 12
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 12
% 0.21/0.51 # Processed clauses : 101
% 0.21/0.51 # ...of these trivial : 7
% 0.21/0.51 # ...subsumed : 16
% 0.21/0.51 # ...remaining for further processing : 78
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 6
% 0.21/0.51 # Backward-rewritten : 11
% 0.21/0.51 # Generated clauses : 163
% 0.21/0.51 # ...of the previous two non-redundant : 117
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 8
% 0.21/0.51 # Paramodulations : 8
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 5
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 17
% 0.21/0.51 # ...of those cached : 14
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 31
% 0.21/0.51 # Positive orientable unit clauses : 3
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 27
% 0.21/0.51 # Current number of unprocessed clauses: 35
% 0.21/0.51 # ...number of literals in the above : 131
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 47
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 244
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 99
% 0.21/0.51 # Non-unit clause-clause subsumptions : 27
% 0.21/0.51 # Unit Clause-clause subsumption calls : 41
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 3
% 0.21/0.51 # BW rewrite match successes : 3
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 43061
% 0.21/0.51 # Search garbage collected termcells : 219
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.015 s
% 0.21/0.51 # System time : 0.007 s
% 0.21/0.51 # Total time : 0.022 s
% 0.21/0.51 # Maximum resident set size: 1852 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.066 s
% 0.21/0.51 # System time : 0.015 s
% 0.21/0.51 # Total time : 0.081 s
% 0.21/0.51 # Maximum resident set size: 1708 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------