TSTP Solution File: SYO067^4.001 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO067^4.001 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 08:44:30 EDT 2024
% Result : Theorem 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 28
% Syntax : Number of formulae : 68 ( 27 unt; 16 typ; 0 def)
% Number of atoms : 170 ( 19 equ; 0 cnn)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 378 ( 39 ~; 62 |; 7 &; 253 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 69 ( 69 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 2 con; 0-3 aty)
% Number of variables : 108 ( 42 ^ 66 !; 0 ?; 108 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
irel: $i > $i > $o ).
thf(decl_23,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_24,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_28,type,
iatom: ( $i > $o ) > $i > $o ).
thf(decl_33,type,
ior: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
ivalid: ( $i > $o ) > $o ).
thf(decl_42,type,
f: $i > $o ).
thf(decl_43,type,
p1: $i > $o ).
thf(decl_44,type,
esk1_1: $i > $i ).
thf(decl_45,type,
esk2_1: $i > $i ).
thf(decl_46,type,
esk3_1: $i > $i ).
thf(decl_47,type,
esk4_1: $i > $i ).
thf(decl_48,type,
esk5_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X10: $i > $o,X11: $i > $o] : ( mor @ ( mnot @ X10 ) @ X11 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X5: $i] :
~ ( X4 @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X5: $i] :
( ( X6 @ X5 )
| ( X7 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mor) ).
thf(ior,axiom,
( ior
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mor @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',ior) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X12: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X12 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mbox_s4) ).
thf(iimplies,axiom,
( iimplies
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mimplies @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',iimplies) ).
thf(iatom,axiom,
( iatom
= ( ^ [X12: $i > $o] : X12 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',iatom) ).
thf(ivalid,axiom,
( ivalid
= ( ^ [X15: $i > $o] :
! [X13: $i] : ( X15 @ X13 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',ivalid) ).
thf(axiom1,axiom,
ivalid @ ( iimplies @ ( ior @ ( iatom @ p1 ) @ ( iimplies @ ( iatom @ p1 ) @ ( iatom @ f ) ) ) @ ( iatom @ f ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).
thf(refl_axiom,axiom,
! [X1: $i] : ( irel @ X1 @ X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',refl_axiom) ).
thf(trans_axiom,axiom,
! [X1: $i,X2: $i,X3: $i] :
( ( ( irel @ X1 @ X2 )
& ( irel @ X2 @ X3 ) )
=> ( irel @ X1 @ X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',trans_axiom) ).
thf(con,conjecture,
ivalid @ ( iatom @ f ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_13,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_14,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_15,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ior]) ).
thf(c_0_16,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X2: $i] :
( ( irel @ Z1 @ X2 )
=> ( Z0 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_17,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iimplies]) ).
thf(c_0_18,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_19,plain,
( iatom
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[iatom]) ).
thf(c_0_20,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
thf(c_0_21,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
thf(c_0_22,plain,
( ivalid
= ( ^ [Z0: $i > $o] :
! [X13: $i] : ( Z0 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[ivalid]) ).
thf(c_0_23,plain,
! [X43: $i] :
( ~ ! [X41: $i] :
( ( irel @ X43 @ X41 )
=> ( ! [X39: $i] :
( ( irel @ X41 @ X39 )
=> ( p1 @ X39 ) )
| ! [X40: $i] :
( ( irel @ X41 @ X40 )
=> ( ~ ! [X37: $i] :
( ( irel @ X40 @ X37 )
=> ( p1 @ X37 ) )
| ! [X38: $i] :
( ( irel @ X40 @ X38 )
=> ( f @ X38 ) ) ) ) ) )
| ! [X42: $i] :
( ( irel @ X43 @ X42 )
=> ( f @ X42 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom1,c_0_19]),c_0_20]),c_0_21]),c_0_22]) ).
thf(c_0_24,plain,
! [X49: $i,X53: $i,X55: $i] :
( ( ( irel @ X49 @ ( esk1_1 @ X49 ) )
| ~ ( irel @ X49 @ X55 )
| ( f @ X55 ) )
& ( ( irel @ ( esk1_1 @ X49 ) @ ( esk2_1 @ X49 ) )
| ~ ( irel @ X49 @ X55 )
| ( f @ X55 ) )
& ( ~ ( p1 @ ( esk2_1 @ X49 ) )
| ~ ( irel @ X49 @ X55 )
| ( f @ X55 ) )
& ( ( irel @ ( esk1_1 @ X49 ) @ ( esk3_1 @ X49 ) )
| ~ ( irel @ X49 @ X55 )
| ( f @ X55 ) )
& ( ~ ( irel @ ( esk3_1 @ X49 ) @ X53 )
| ( p1 @ X53 )
| ~ ( irel @ X49 @ X55 )
| ( f @ X55 ) )
& ( ( irel @ ( esk3_1 @ X49 ) @ ( esk4_1 @ X49 ) )
| ~ ( irel @ X49 @ X55 )
| ( f @ X55 ) )
& ( ~ ( f @ ( esk4_1 @ X49 ) )
| ~ ( irel @ X49 @ X55 )
| ( f @ X55 ) ) ),
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_23])])])])])]) ).
thf(c_0_25,plain,
! [X45: $i] : ( irel @ X45 @ X45 ),
inference(variable_rename,[status(thm)],[refl_axiom]) ).
thf(c_0_26,plain,
! [X46: $i,X47: $i,X48: $i] :
( ~ ( irel @ X46 @ X47 )
| ~ ( irel @ X47 @ X48 )
| ( irel @ X46 @ X48 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[trans_axiom])])]) ).
thf(c_0_27,plain,
! [X1: $i,X2: $i] :
( ( irel @ ( esk1_1 @ X1 ) @ ( esk2_1 @ X1 ) )
| ( f @ X2 )
| ~ ( irel @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,plain,
! [X1: $i] : ( irel @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_29,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( irel @ X1 @ X3 )
| ~ ( irel @ X1 @ X2 )
| ~ ( irel @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_30,plain,
! [X1: $i] :
( ( irel @ ( esk1_1 @ X1 ) @ ( esk2_1 @ X1 ) )
| ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_31,plain,
! [X1: $i,X2: $i] :
( ( irel @ X1 @ ( esk1_1 @ X1 ) )
| ( f @ X2 )
| ~ ( irel @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_32,plain,
! [X1: $i,X2: $i] :
( ( irel @ X1 @ ( esk2_1 @ X2 ) )
| ( f @ X2 )
| ~ ( irel @ X1 @ ( esk1_1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_33,plain,
! [X1: $i] :
( ( irel @ X1 @ ( esk1_1 @ X1 ) )
| ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
thf(c_0_34,plain,
! [X1: $i] :
( ( irel @ X1 @ ( esk2_1 @ X1 ) )
| ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_35,plain,
! [X1: $i,X2: $i] :
( ( irel @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( f @ X2 )
| ~ ( irel @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_36,plain,
! [X1: $i,X2: $i] :
( ( irel @ X1 @ ( esk2_1 @ X2 ) )
| ( f @ X2 )
| ~ ( irel @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_34]) ).
thf(c_0_37,plain,
! [X1: $i] :
( ( irel @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
thf(c_0_38,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( p1 @ X2 )
| ( f @ X3 )
| ~ ( irel @ ( esk3_1 @ X1 ) @ X2 )
| ~ ( irel @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_39,plain,
! [X1: $i] :
( ( irel @ ( esk3_1 @ X1 ) @ ( esk2_1 @ ( esk4_1 @ X1 ) ) )
| ( f @ ( esk4_1 @ X1 ) )
| ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_40,plain,
! [X1: $i,X2: $i] :
( ( f @ X2 )
| ~ ( f @ ( esk4_1 @ X1 ) )
| ~ ( irel @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_41,plain,
! [X1: $i,X2: $i] :
( ( p1 @ ( esk2_1 @ ( esk4_1 @ X1 ) ) )
| ( f @ X1 )
| ( f @ X2 )
| ~ ( irel @ X1 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
thf(c_0_42,plain,
! [X1: $i,X2: $i] :
( ( f @ X2 )
| ~ ( p1 @ ( esk2_1 @ X1 ) )
| ~ ( irel @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_43,plain,
! [X1: $i] :
( ( p1 @ ( esk2_1 @ ( esk4_1 @ X1 ) ) )
| ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_41,c_0_28]) ).
thf(c_0_44,plain,
! [X1: $i,X2: $i] :
( ( f @ X1 )
| ( f @ X2 )
| ~ ( irel @ ( esk4_1 @ X1 ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_45,negated_conjecture,
~ ! [X44: $i] : ( f @ X44 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_19]),c_0_22]) ).
thf(c_0_46,plain,
! [X1: $i] :
( ( f @ ( esk4_1 @ X1 ) )
| ( f @ X1 ) ),
inference(spm,[status(thm)],[c_0_44,c_0_28]) ).
thf(c_0_47,negated_conjecture,
~ ( f @ esk5_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])]) ).
thf(c_0_48,plain,
! [X1: $i,X2: $i] :
( ( f @ X1 )
| ( f @ X2 )
| ~ ( irel @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_40,c_0_46]) ).
thf(c_0_49,negated_conjecture,
~ ( f @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
thf(c_0_50,plain,
! [X1: $i] : ( f @ X1 ),
inference(spm,[status(thm)],[c_0_48,c_0_28]) ).
thf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO067^4.001 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 09:36:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.48 Running higher-order theorem proving
% 0.18/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.18/0.52 # Version: 3.1.0-ho
% 0.18/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.18/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.18/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.18/0.52 # Starting full_lambda_8 with 300s (1) cores
% 0.18/0.52 # new_ho_10_cnf2 with pid 21103 completed with status 0
% 0.18/0.52 # Result found by new_ho_10_cnf2
% 0.18/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.18/0.52 # No SInE strategy applied
% 0.18/0.52 # Search class: HGUNF-FFSF11-SHSSMFNN
% 0.18/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52 # Starting sh7 with 811s (1) cores
% 0.18/0.52 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.18/0.52 # Starting post_as_ho1 with 136s (1) cores
% 0.18/0.52 # Starting lpo5_fix with 136s (1) cores
% 0.18/0.52 # Starting lpo1_def_fix with 136s (1) cores
% 0.18/0.52 # post_as_ho1 with pid 21112 completed with status 0
% 0.18/0.52 # Result found by post_as_ho1
% 0.18/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.18/0.52 # No SInE strategy applied
% 0.18/0.52 # Search class: HGUNF-FFSF11-SHSSMFNN
% 0.18/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52 # Starting sh7 with 811s (1) cores
% 0.18/0.52 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.18/0.52 # Starting post_as_ho1 with 136s (1) cores
% 0.18/0.52 # Preprocessing time : 0.001 s
% 0.18/0.52 # Presaturation interreduction done
% 0.18/0.52
% 0.18/0.52 # Proof found!
% 0.18/0.52 # SZS status Theorem
% 0.18/0.52 # SZS output start CNFRefutation
% See solution above
% 0.18/0.52 # Parsed axioms : 45
% 0.18/0.52 # Removed by relevancy pruning/SinE : 0
% 0.18/0.52 # Initial clauses : 32
% 0.18/0.52 # Removed in clause preprocessing : 22
% 0.18/0.52 # Initial clauses in saturation : 10
% 0.18/0.52 # Processed clauses : 197
% 0.18/0.52 # ...of these trivial : 0
% 0.18/0.52 # ...subsumed : 94
% 0.18/0.52 # ...remaining for further processing : 103
% 0.18/0.52 # Other redundant clauses eliminated : 0
% 0.18/0.52 # Clauses deleted for lack of memory : 0
% 0.18/0.52 # Backward-subsumed : 21
% 0.18/0.52 # Backward-rewritten : 69
% 0.18/0.52 # Generated clauses : 1122
% 0.18/0.52 # ...of the previous two non-redundant : 1121
% 0.18/0.52 # ...aggressively subsumed : 0
% 0.18/0.52 # Contextual simplify-reflections : 2
% 0.18/0.52 # Paramodulations : 1122
% 0.18/0.52 # Factorizations : 0
% 0.18/0.52 # NegExts : 0
% 0.18/0.52 # Equation resolutions : 0
% 0.18/0.52 # Disequality decompositions : 0
% 0.18/0.52 # Total rewrite steps : 110
% 0.18/0.52 # ...of those cached : 100
% 0.18/0.52 # Propositional unsat checks : 0
% 0.18/0.52 # Propositional check models : 0
% 0.18/0.52 # Propositional check unsatisfiable : 0
% 0.18/0.52 # Propositional clauses : 0
% 0.18/0.52 # Propositional clauses after purity: 0
% 0.18/0.52 # Propositional unsat core size : 0
% 0.18/0.52 # Propositional preprocessing time : 0.000
% 0.18/0.52 # Propositional encoding time : 0.000
% 0.18/0.52 # Propositional solver time : 0.000
% 0.18/0.52 # Success case prop preproc time : 0.000
% 0.18/0.52 # Success case prop encoding time : 0.000
% 0.18/0.52 # Success case prop solver time : 0.000
% 0.18/0.52 # Current number of processed clauses : 3
% 0.18/0.52 # Positive orientable unit clauses : 2
% 0.18/0.52 # Positive unorientable unit clauses: 0
% 0.18/0.52 # Negative unit clauses : 0
% 0.18/0.52 # Non-unit-clauses : 1
% 0.18/0.52 # Current number of unprocessed clauses: 930
% 0.18/0.52 # ...number of literals in the above : 4106
% 0.18/0.52 # Current number of archived formulas : 0
% 0.18/0.52 # Current number of archived clauses : 100
% 0.18/0.52 # Clause-clause subsumption calls (NU) : 1292
% 0.18/0.52 # Rec. Clause-clause subsumption calls : 695
% 0.18/0.52 # Non-unit clause-clause subsumptions : 117
% 0.18/0.52 # Unit Clause-clause subsumption calls : 0
% 0.18/0.52 # Rewrite failures with RHS unbound : 0
% 0.18/0.52 # BW rewrite match attempts : 10
% 0.18/0.52 # BW rewrite match successes : 10
% 0.18/0.52 # Condensation attempts : 0
% 0.18/0.52 # Condensation successes : 0
% 0.18/0.52 # Termbank termtop insertions : 21306
% 0.18/0.52 # Search garbage collected termcells : 636
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.027 s
% 0.18/0.52 # System time : 0.004 s
% 0.18/0.52 # Total time : 0.030 s
% 0.18/0.52 # Maximum resident set size: 1920 pages
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.132 s
% 0.18/0.52 # System time : 0.012 s
% 0.18/0.52 # Total time : 0.143 s
% 0.18/0.52 # Maximum resident set size: 1760 pages
% 0.18/0.52 % E---3.1 exiting
% 0.18/0.52 % E exiting
%------------------------------------------------------------------------------