TSTP Solution File: SEU781^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU781^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:30:11 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of formulae : 41 ( 14 unt; 15 typ; 0 def)
% Number of atoms : 135 ( 6 equ; 0 cnn)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 629 ( 56 ~; 50 |; 15 &; 472 @)
% ( 1 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 8 con; 0-5 aty)
% Number of variables : 75 ( 12 ^ 60 !; 3 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
subset: $i > $i > $o ).
thf(decl_24,type,
kpair: $i > $i > $i ).
thf(decl_25,type,
cartprod: $i > $i > $i ).
thf(decl_26,type,
breln: $i > $i > $i > $o ).
thf(decl_27,type,
breln1: $i > $i > $o ).
thf(decl_28,type,
breln1compset: $i > $i > $i > $i ).
thf(decl_29,type,
breln1compE: $o ).
thf(decl_30,type,
esk1_5: $i > $i > $i > $i > $i > $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(decl_33,type,
esk4_0: $i ).
thf(decl_34,type,
esk5_0: $i ).
thf(decl_35,type,
esk6_0: $i ).
thf(decl_36,type,
epred1_0: $o ).
thf(breln1,axiom,
( breln1
= ( ^ [X1: $i,X4: $i] : ( breln @ X1 @ X1 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X2: $i,X3: $i] : ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln) ).
thf(breln1compE,axiom,
( breln1compE
<=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i] :
( ( breln1 @ X1 @ X5 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ ( breln1compset @ X1 @ X4 @ X5 ) )
=> ? [X8: $i] :
( ( in @ X8 @ X1 )
& ( in @ ( kpair @ X6 @ X8 ) @ X4 )
& ( in @ ( kpair @ X8 @ X7 ) @ X5 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1compE) ).
thf(breln1compEex,conjecture,
( breln1compE
=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i] :
( ( breln1 @ X1 @ X5 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ ( breln1compset @ X1 @ X4 @ X5 ) )
=> ! [X9: $o] :
( ! [X8: $i] :
( ( in @ X8 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X8 ) @ X4 )
=> ( ( in @ ( kpair @ X8 @ X7 ) @ X5 )
=> X9 ) ) )
=> X9 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1compEex) ).
thf(c_0_4,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln1]) ).
thf(c_0_5,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_6,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,axiom,
( breln1compE
= ( ! [X1: $i,X4: $i] :
( ( subset @ X4 @ ( cartprod @ X1 @ X1 ) )
=> ! [X5: $i] :
( ( subset @ X5 @ ( cartprod @ X1 @ X1 ) )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ ( breln1compset @ X1 @ X4 @ X5 ) )
=> ? [X8: $i] :
( ( in @ X8 @ X1 )
& ( in @ ( kpair @ X6 @ X8 ) @ X4 )
& ( in @ ( kpair @ X8 @ X7 ) @ X5 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[breln1compE,c_0_6]) ).
thf(c_0_8,negated_conjecture,
~ ( ! [X23: $i,X24: $i] :
( ( subset @ X24 @ ( cartprod @ X23 @ X23 ) )
=> ! [X25: $i] :
( ( subset @ X25 @ ( cartprod @ X23 @ X23 ) )
=> ! [X26: $i] :
( ( in @ X26 @ X23 )
=> ! [X27: $i] :
( ( in @ X27 @ X23 )
=> ( ( in @ ( kpair @ X26 @ X27 ) @ ( breln1compset @ X23 @ X24 @ X25 ) )
=> ? [X28: $i] :
( ( in @ X28 @ X23 )
& ( in @ ( kpair @ X26 @ X28 ) @ X24 )
& ( in @ ( kpair @ X28 @ X27 ) @ X25 ) ) ) ) ) ) )
=> ! [X1: $i,X4: $i] :
( ( subset @ X4 @ ( cartprod @ X1 @ X1 ) )
=> ! [X5: $i] :
( ( subset @ X5 @ ( cartprod @ X1 @ X1 ) )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ ( breln1compset @ X1 @ X4 @ X5 ) )
=> ! [X9: $o] :
( ! [X8: $i] :
( ( in @ X8 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X8 ) @ X4 )
=> ( ( in @ ( kpair @ X8 @ X7 ) @ X5 )
=> X9 ) ) )
=> X9 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1compEex]),c_0_7]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X29: $i,X30: $i,X31: $i,X32: $i,X33: $i,X41: $i] :
( ( ( in @ ( esk1_5 @ X29 @ X30 @ X31 @ X32 @ X33 ) @ X29 )
| ~ ( in @ ( kpair @ X32 @ X33 ) @ ( breln1compset @ X29 @ X30 @ X31 ) )
| ~ ( in @ X33 @ X29 )
| ~ ( in @ X32 @ X29 )
| ~ ( subset @ X31 @ ( cartprod @ X29 @ X29 ) )
| ~ ( subset @ X30 @ ( cartprod @ X29 @ X29 ) ) )
& ( ( in @ ( kpair @ X32 @ ( esk1_5 @ X29 @ X30 @ X31 @ X32 @ X33 ) ) @ X30 )
| ~ ( in @ ( kpair @ X32 @ X33 ) @ ( breln1compset @ X29 @ X30 @ X31 ) )
| ~ ( in @ X33 @ X29 )
| ~ ( in @ X32 @ X29 )
| ~ ( subset @ X31 @ ( cartprod @ X29 @ X29 ) )
| ~ ( subset @ X30 @ ( cartprod @ X29 @ X29 ) ) )
& ( ( in @ ( kpair @ ( esk1_5 @ X29 @ X30 @ X31 @ X32 @ X33 ) @ X33 ) @ X31 )
| ~ ( in @ ( kpair @ X32 @ X33 ) @ ( breln1compset @ X29 @ X30 @ X31 ) )
| ~ ( in @ X33 @ X29 )
| ~ ( in @ X32 @ X29 )
| ~ ( subset @ X31 @ ( cartprod @ X29 @ X29 ) )
| ~ ( subset @ X30 @ ( cartprod @ X29 @ X29 ) ) )
& ( subset @ esk3_0 @ ( cartprod @ esk2_0 @ esk2_0 ) )
& ( subset @ esk4_0 @ ( cartprod @ esk2_0 @ esk2_0 ) )
& ( in @ esk5_0 @ esk2_0 )
& ( in @ esk6_0 @ esk2_0 )
& ( in @ ( kpair @ esk5_0 @ esk6_0 ) @ ( breln1compset @ esk2_0 @ esk3_0 @ esk4_0 ) )
& ( ~ ( in @ X41 @ esk2_0 )
| ~ ( in @ ( kpair @ esk5_0 @ X41 ) @ esk3_0 )
| ~ ( in @ ( kpair @ X41 @ esk6_0 ) @ esk4_0 )
| epred1_0 )
& ~ epred1_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_8])])])])])]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( epred1_0
| ~ ( in @ X1 @ esk2_0 )
| ~ ( in @ ( kpair @ esk5_0 @ X1 ) @ esk3_0 )
| ~ ( in @ ( kpair @ X1 @ esk6_0 ) @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
~ epred1_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X5: $i,X4: $i,X3: $i,X2: $i,X1: $i] :
( ( in @ ( kpair @ ( esk1_5 @ X1 @ X2 @ X3 @ X4 @ X5 ) @ X5 ) @ X3 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ ( breln1compset @ X1 @ X2 @ X3 ) )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ X4 @ X1 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X1 ) )
| ~ ( subset @ X2 @ ( cartprod @ X1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
subset @ esk4_0 @ ( cartprod @ esk2_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i] :
( ~ ( in @ ( kpair @ X1 @ esk6_0 ) @ esk4_0 )
| ~ ( in @ ( kpair @ esk5_0 @ X1 ) @ esk3_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( kpair @ ( esk1_5 @ esk2_0 @ X1 @ esk4_0 @ X2 @ X3 ) @ X3 ) @ esk4_0 )
| ~ ( in @ ( kpair @ X2 @ X3 ) @ ( breln1compset @ esk2_0 @ X1 @ esk4_0 ) )
| ~ ( subset @ X1 @ ( cartprod @ esk2_0 @ esk2_0 ) )
| ~ ( in @ X3 @ esk2_0 )
| ~ ( in @ X2 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
in @ esk6_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X5: $i,X4: $i,X3: $i,X2: $i] :
( ( in @ ( kpair @ X1 @ ( esk1_5 @ X2 @ X3 @ X4 @ X1 @ X5 ) ) @ X3 )
| ~ ( in @ ( kpair @ X1 @ X5 ) @ ( breln1compset @ X2 @ X3 @ X4 ) )
| ~ ( in @ X5 @ X2 )
| ~ ( in @ X1 @ X2 )
| ~ ( subset @ X4 @ ( cartprod @ X2 @ X2 ) )
| ~ ( subset @ X3 @ ( cartprod @ X2 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( in @ ( kpair @ esk5_0 @ ( esk1_5 @ esk2_0 @ X1 @ esk4_0 @ X2 @ esk6_0 ) ) @ esk3_0 )
| ~ ( in @ ( esk1_5 @ esk2_0 @ X1 @ esk4_0 @ X2 @ esk6_0 ) @ esk2_0 )
| ~ ( in @ ( kpair @ X2 @ esk6_0 ) @ ( breln1compset @ esk2_0 @ X1 @ esk4_0 ) )
| ~ ( subset @ X1 @ ( cartprod @ esk2_0 @ esk2_0 ) )
| ~ ( in @ X2 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( kpair @ X1 @ ( esk1_5 @ esk2_0 @ X2 @ esk4_0 @ X1 @ X3 ) ) @ X2 )
| ~ ( in @ ( kpair @ X1 @ X3 ) @ ( breln1compset @ esk2_0 @ X2 @ esk4_0 ) )
| ~ ( subset @ X2 @ ( cartprod @ esk2_0 @ esk2_0 ) )
| ~ ( in @ X3 @ esk2_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
thf(c_0_20,negated_conjecture,
in @ ( kpair @ esk5_0 @ esk6_0 ) @ ( breln1compset @ esk2_0 @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_21,negated_conjecture,
subset @ esk3_0 @ ( cartprod @ esk2_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_22,negated_conjecture,
in @ esk5_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_23,negated_conjecture,
~ ( in @ ( esk1_5 @ esk2_0 @ esk3_0 @ esk4_0 @ esk5_0 @ esk6_0 ) @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_16])]) ).
thf(c_0_24,negated_conjecture,
! [X5: $i,X4: $i,X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_5 @ X1 @ X2 @ X3 @ X4 @ X5 ) @ X1 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ ( breln1compset @ X1 @ X2 @ X3 ) )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ X4 @ X1 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X1 ) )
| ~ ( subset @ X2 @ ( cartprod @ X1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_13]),c_0_21]),c_0_16]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU781^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:18:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # Starting ho_unfolding_2 with 300s (1) cores
% 0.20/0.49 # post_as_ho5 with pid 4190 completed with status 0
% 0.20/0.49 # Result found by post_as_ho5
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.49 # Search class: HHUNF-FFSS33-SSFFMFNN
% 0.20/0.49 # partial match(3): HHUNF-FFSS21-SFFFMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 4193 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho5 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.49 # Search class: HHUNF-FFSS33-SSFFMFNN
% 0.20/0.49 # partial match(3): HHUNF-FFSS21-SFFFMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 12
% 0.20/0.49 # Removed by relevancy pruning/SinE : 8
% 0.20/0.49 # Initial clauses : 10
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 10
% 0.20/0.49 # Processed clauses : 24
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 24
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 7
% 0.20/0.49 # ...of the previous two non-redundant : 6
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 7
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 10
% 0.20/0.49 # ...of those cached : 5
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 14
% 0.20/0.49 # Positive orientable unit clauses : 5
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 7
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 10
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 10
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 36
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 7
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 24
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 2041
% 0.20/0.49 # Search garbage collected termcells : 472
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1900 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.011 s
% 0.20/0.49 # Maximum resident set size: 1708 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------