TSTP Solution File: SEU695^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU695^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 03:29:13 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 47 ( 12 unt; 15 typ; 0 def)
% Number of atoms : 114 ( 17 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 505 ( 37 ~; 30 |; 6 &; 391 @)
% ( 6 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 8 con; 0-4 aty)
% Number of variables : 117 ( 14 ^ 103 !; 0 ?; 117 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
kpair: $i > $i > $i ).
thf(decl_24,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(decl_25,type,
dpsetconstrI: $o ).
thf(decl_26,type,
func: $i > $i > $i > $o ).
thf(decl_27,type,
ap: $i > $i > $i > $i > $i ).
thf(decl_28,type,
lam: $i > $i > ( $i > $i ) > $i ).
thf(decl_29,type,
lamp: $o ).
thf(decl_30,type,
funcGraphProp2: $o ).
thf(decl_31,type,
esk1_3: $i > $i > ( $i > $i ) > $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(decl_34,type,
esk4_0: $i > $i ).
thf(decl_35,type,
esk5_0: $i ).
thf(decl_36,type,
epred1_1: ( $i > $i ) > $i > $i > $o ).
thf(dpsetconstrI,axiom,
( dpsetconstrI
<=> ! [X1: $i,X2: $i,X3: $i > $i > $o,X4: $i] :
( ( in @ X4 @ X1 )
=> ! [X5: $i] :
( ( in @ X5 @ X2 )
=> ( ( X3 @ X4 @ X5 )
=> ( in @ ( kpair @ X4 @ X5 )
@ ( dpsetconstr @ X1 @ X2
@ ^ [X6: $i,X7: $i] : ( X3 @ X6 @ X7 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrI) ).
thf(lamp,axiom,
( lamp
<=> ! [X1: $i,X2: $i,X8: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X8 @ X4 ) @ X2 ) )
=> ( func @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [X4: $i] : ( X8 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lamp) ).
thf(beta1,conjecture,
( dpsetconstrI
=> ( lamp
=> ( funcGraphProp2
=> ! [X1: $i,X2: $i,X8: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X8 @ X4 ) @ X2 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [X5: $i] : ( X8 @ X5 ) )
@ X4 )
= ( X8 @ X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',beta1) ).
thf(funcGraphProp2,axiom,
( funcGraphProp2
<=> ! [X1: $i,X2: $i,X9: $i] :
( ( func @ X1 @ X2 @ X9 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ! [X5: $i] :
( ( in @ X5 @ X2 )
=> ( ( in @ ( kpair @ X4 @ X5 ) @ X9 )
=> ( ( ap @ X1 @ X2 @ X9 @ X4 )
= X5 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',funcGraphProp2) ).
thf(lam,axiom,
( lam
= ( ^ [X1: $i,X2: $i,X8: $i > $i] :
( dpsetconstr @ X1 @ X2
@ ^ [X4: $i,X5: $i] :
( ( X8 @ X4 )
= X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lam) ).
thf(c_0_5,plain,
( dpsetconstrI
<=> ! [X1: $i,X2: $i,X3: $i > $i > $o,X4: $i] :
( ( in @ X4 @ X1 )
=> ! [X5: $i] :
( ( in @ X5 @ X2 )
=> ( ( X3 @ X4 @ X5 )
=> ( in @ ( kpair @ X4 @ X5 )
@ ( dpsetconstr @ X1 @ X2
@ ^ [Z0: $i,Z1: $i] : ( X3 @ Z0 @ Z1 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dpsetconstrI]) ).
thf(c_0_6,plain,
( lamp
<=> ! [X1: $i,X2: $i,X8: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X8 @ X4 ) @ X2 ) )
=> ( func @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [Z0: $i] : ( X8 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[lamp]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X29: $i,X30: $i,X31: $i > $i > $o,X32: $i] :
( ( in @ X32 @ X29 )
=> ! [X33: $i] :
( ( in @ X33 @ X30 )
=> ( ( X31 @ X32 @ X33 )
=> ( in @ ( kpair @ X32 @ X33 ) @ ( dpsetconstr @ X29 @ X30 @ X31 ) ) ) ) )
=> ( ! [X34: $i,X35: $i,X36: $i > $i] :
( ! [X37: $i] :
( ( in @ X37 @ X34 )
=> ( in @ ( X36 @ X37 ) @ X35 ) )
=> ( func @ X34 @ X35 @ ( lam @ X34 @ X35 @ X36 ) ) )
=> ( ! [X38: $i,X39: $i,X40: $i] :
( ( func @ X38 @ X39 @ X40 )
=> ! [X41: $i] :
( ( in @ X41 @ X38 )
=> ! [X42: $i] :
( ( in @ X42 @ X39 )
=> ( ( in @ ( kpair @ X41 @ X42 ) @ X40 )
=> ( ( ap @ X38 @ X39 @ X40 @ X41 )
= X42 ) ) ) ) )
=> ! [X1: $i,X2: $i,X8: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X8 @ X4 ) @ X2 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2 @ ( lam @ X1 @ X2 @ X8 ) @ X4 )
= ( X8 @ X4 ) ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[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)],[beta1])]),c_0_5]),c_0_6]),funcGraphProp2])]) ).
thf(c_0_8,plain,
! [X43: $i,X44: $i,X45: $i > $i] :
( ( lam @ X43 @ X44 @ X45 )
= ( dpsetconstr @ X43 @ X44
@ ^ [Z0: $i] : ( $eq @ ( X45 @ Z0 ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[lam])])]) ).
thf(c_0_9,negated_conjecture,
! [X49: $i,X50: $i,X51: $i > $i > $o,X52: $i,X53: $i,X54: $i,X55: $i,X56: $i > $i,X58: $i,X59: $i,X60: $i,X61: $i,X62: $i,X66: $i] :
( ( ~ ( in @ X52 @ X49 )
| ~ ( in @ X53 @ X50 )
| ~ ( X51 @ X52 @ X53 )
| ( in @ ( kpair @ X52 @ X53 ) @ ( dpsetconstr @ X49 @ X50 @ X51 ) ) )
& ( ( in @ ( esk1_3 @ X54 @ X55 @ X56 ) @ X54 )
| ( func @ X54 @ X55 @ ( lam @ X54 @ X55 @ X56 ) ) )
& ( ~ ( in @ ( X56 @ ( esk1_3 @ X54 @ X55 @ X56 ) ) @ X55 )
| ( func @ X54 @ X55 @ ( lam @ X54 @ X55 @ X56 ) ) )
& ( ~ ( func @ X58 @ X59 @ X60 )
| ~ ( in @ X61 @ X58 )
| ~ ( in @ X62 @ X59 )
| ~ ( in @ ( kpair @ X61 @ X62 ) @ X60 )
| ( ( ap @ X58 @ X59 @ X60 @ X61 )
= X62 ) )
& ( ~ ( in @ X66 @ esk2_0 )
| ( in @ ( esk4_0 @ X66 ) @ esk3_0 ) )
& ( in @ esk5_0 @ esk2_0 )
& ( ( ap @ esk2_0 @ esk3_0 @ ( lam @ esk2_0 @ esk3_0 @ esk4_0 ) @ esk5_0 )
!= ( esk4_0 @ esk5_0 ) ) ),
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_7])])])])])]) ).
thf(c_0_10,plain,
! [X46: $i,X47: $i,X48: $i > $i] :
( ( lam @ X46 @ X47 @ X48 )
= ( dpsetconstr @ X46 @ X47
@ ^ [Z0: $i] : ( $eq @ ( X48 @ Z0 ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
! [X68: $i,X8: $i > $i] :
( ( epred1_1 @ X8 @ X68 )
= ( $eq @ ( X8 @ X68 ) ) ),
introduced(definition) ).
thf(c_0_12,plain,
! [X69: $i,X70: $i > $i] :
( ( epred1_1 @ X70 @ X69 )
= ( $eq @ ( X70 @ X69 ) ) ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_13,negated_conjecture,
( ( ap @ esk2_0 @ esk3_0 @ ( lam @ esk2_0 @ esk3_0 @ esk4_0 ) @ esk5_0 )
!= ( esk4_0 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X6: $i,X5: $i,X4: $i] :
( ( ( ap @ X1 @ X2 @ X4 @ X5 )
= X6 )
| ~ ( func @ X1 @ X2 @ X4 )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ X6 @ X2 )
| ~ ( in @ ( kpair @ X5 @ X6 ) @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
in @ esk5_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X3: $i > $i > $o,X2: $i,X5: $i,X4: $i] :
( ( in @ ( kpair @ X1 @ X4 ) @ ( dpsetconstr @ X2 @ X5 @ X3 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X4 @ X5 )
| ~ ( X3 @ X1 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_17,plain,
! [X1: $i,X2: $i,X8: $i > $i] :
( ( lam @ X1 @ X2 @ X8 )
= ( dpsetconstr @ X1 @ X2 @ ( epred1_1 @ X8 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10]),c_0_11]) ).
thf(c_0_18,plain,
! [X8: $i > $i,X1: $i] :
( ( epred1_1 @ X8 @ X1 )
= ( $eq @ ( X8 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
( ~ ( in @ ( kpair @ esk5_0 @ ( esk4_0 @ esk5_0 ) ) @ ( lam @ esk2_0 @ esk3_0 @ esk4_0 ) )
| ~ ( func @ esk2_0 @ esk3_0 @ ( lam @ esk2_0 @ esk3_0 @ esk4_0 ) )
| ~ ( in @ ( esk4_0 @ esk5_0 ) @ esk3_0 ) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])])]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X2: $i,X8: $i > $i,X5: $i,X4: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( lam @ X4 @ X5 @ X8 ) )
| ~ ( epred1_1 @ X8 @ X1 @ X2 )
| ~ ( in @ X2 @ X5 )
| ~ ( in @ X1 @ X4 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_21,plain,
! [X1: $i,X8: $i > $i,X71: $i] :
( ( epred1_1 @ X8 @ X1 @ X71 )
<=> ( ( X8 @ X1 )
= X71 ) ),
inference(arg_cong,[status(thm)],[c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ~ ( func @ esk2_0 @ esk3_0 @ ( lam @ esk2_0 @ esk3_0 @ esk4_0 ) )
| ~ ( epred1_1 @ esk4_0 @ esk5_0 @ ( esk4_0 @ esk5_0 ) )
| ~ ( in @ ( esk4_0 @ esk5_0 ) @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15])]) ).
thf(c_0_23,plain,
! [X8: $i > $i,X1: $i] : ( epred1_1 @ X8 @ X1 @ ( X8 @ X1 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_21])]) ).
thf(c_0_24,negated_conjecture,
( ~ ( func @ esk2_0 @ esk3_0 @ ( lam @ esk2_0 @ esk3_0 @ esk4_0 ) )
| ~ ( in @ ( esk4_0 @ esk5_0 ) @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X8: $i > $i,X2: $i] :
( ( func @ X1 @ X2 @ ( lam @ X1 @ X2 @ X8 ) )
| ~ ( in @ ( X8 @ ( esk1_3 @ X1 @ X2 @ X8 ) ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_26,negated_conjecture,
( ~ ( in @ ( esk4_0 @ ( esk1_3 @ esk2_0 @ esk3_0 @ esk4_0 ) ) @ esk3_0 )
| ~ ( in @ ( esk4_0 @ esk5_0 ) @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk4_0 @ X1 ) @ esk3_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i,X2: $i,X8: $i > $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X8 ) @ X1 )
| ( func @ X1 @ X2 @ ( lam @ X1 @ X2 @ X8 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_29,negated_conjecture,
( ~ ( in @ ( esk1_3 @ esk2_0 @ esk3_0 @ esk4_0 ) @ esk2_0 )
| ~ ( in @ ( esk4_0 @ esk5_0 ) @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_30,negated_conjecture,
~ ( in @ ( esk4_0 @ esk5_0 ) @ esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_29]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU695^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 16:47:08 EDT 2024
% 0.15/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.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting new_ho_7 with 300s (1) cores
% 0.21/0.50 # Starting lpo8_lambda_fix with 300s (1) cores
% 0.21/0.50 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.50 # new_ho_10 with pid 22378 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUSS-FFSF33-SHSFMSBN
% 0.21/0.50 # partial match(2): HGUSM-FFSF32-SHSFMSBN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting sh2 with 811s (1) cores
% 0.21/0.50 # Starting new_ho_10 with 151s (1) cores
% 0.21/0.50 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.50 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 136s (1) cores
% 0.21/0.50 # ho_unfolding_6 with pid 22387 completed with status 0
% 0.21/0.50 # Result found by ho_unfolding_6
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLMNHSA.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUSS-FFSF33-SHSFMSBN
% 0.21/0.50 # partial match(2): HGUSM-FFSF32-SHSFMSBN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting sh2 with 811s (1) cores
% 0.21/0.50 # Starting new_ho_10 with 151s (1) cores
% 0.21/0.50 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.50 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 136s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 14
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 18
% 0.21/0.50 # Removed in clause preprocessing : 9
% 0.21/0.50 # Initial clauses in saturation : 9
% 0.21/0.50 # Processed clauses : 24
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 24
% 0.21/0.50 # Other redundant clauses eliminated : 2
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 7
% 0.21/0.50 # Backward-rewritten : 1
% 0.21/0.50 # Generated clauses : 57
% 0.21/0.50 # ...of the previous two non-redundant : 55
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 2
% 0.21/0.50 # Paramodulations : 52
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 2
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 8
% 0.21/0.50 # ...of those cached : 5
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 15
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 1
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 9
% 0.21/0.50 # Current number of unprocessed clauses: 39
% 0.21/0.50 # ...number of literals in the above : 257
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 9
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 76
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 24
% 0.21/0.50 # Non-unit clause-clause subsumptions : 6
% 0.21/0.50 # Unit Clause-clause subsumption calls : 5
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 5
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 24
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 6144
% 0.21/0.50 # Search garbage collected termcells : 561
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.010 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.013 s
% 0.21/0.50 # Maximum resident set size: 1924 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.042 s
% 0.21/0.50 # System time : 0.012 s
% 0.21/0.50 # Total time : 0.054 s
% 0.21/0.50 # Maximum resident set size: 1740 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------