TSTP Solution File: SEU743^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU743^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:46 EDT 2024
% Result : Theorem 3.52s 0.94s
% Output : CNFRefutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 38 ( 7 unt; 13 typ; 0 def)
% Number of atoms : 135 ( 0 equ; 0 cnn)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 706 ( 57 ~; 55 |; 9 &; 539 @)
% ( 4 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 84 ( 0 ^ 84 !; 0 ?; 84 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
binunion: $i > $i > $i ).
thf(decl_25,type,
binintersect: $i > $i > $i ).
thf(decl_26,type,
binintersectT_lem: $o ).
thf(decl_27,type,
binunionT_lem: $o ).
thf(decl_28,type,
powersetTI1: $o ).
thf(decl_29,type,
inIntersectImpInIntersectUnions: $o ).
thf(decl_30,type,
esk1_3: $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(intersectInPowersetIntersectUnions,conjecture,
( binintersectT_lem
=> ( binunionT_lem
=> ( powersetTI1
=> ( inIntersectImpInIntersectUnions
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ ( binintersect @ ( binunion @ X2 @ X5 ) @ ( binunion @ X3 @ X5 ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersectInPowersetIntersectUnions) ).
thf(binintersectT_lem,axiom,
( binintersectT_lem
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectT_lem) ).
thf(binunionT_lem,axiom,
( binunionT_lem
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( binunion @ X2 @ X3 ) @ ( powerset @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionT_lem) ).
thf(powersetTI1,axiom,
( powersetTI1
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ X4 @ X2 )
=> ( in @ X4 @ X3 ) ) )
=> ( in @ X2 @ ( powerset @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetTI1) ).
thf(inIntersectImpInIntersectUnions,axiom,
( inIntersectImpInIntersectUnions
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ X4 @ ( binintersect @ X2 @ X3 ) )
=> ( in @ X4 @ ( binintersect @ ( binunion @ X2 @ X5 ) @ ( binunion @ X3 @ X5 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inIntersectImpInIntersectUnions) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X25: $i,X26: $i] :
( ( in @ X26 @ ( powerset @ X25 ) )
=> ! [X27: $i] :
( ( in @ X27 @ ( powerset @ X25 ) )
=> ( in @ ( binintersect @ X26 @ X27 ) @ ( powerset @ X25 ) ) ) )
=> ( ! [X28: $i,X29: $i] :
( ( in @ X29 @ ( powerset @ X28 ) )
=> ! [X30: $i] :
( ( in @ X30 @ ( powerset @ X28 ) )
=> ( in @ ( binunion @ X29 @ X30 ) @ ( powerset @ X28 ) ) ) )
=> ( ! [X31: $i,X32: $i] :
( ( in @ X32 @ ( powerset @ X31 ) )
=> ! [X33: $i] :
( ( in @ X33 @ ( powerset @ X31 ) )
=> ( ! [X34: $i] :
( ( in @ X34 @ X31 )
=> ( ( in @ X34 @ X32 )
=> ( in @ X34 @ X33 ) ) )
=> ( in @ X32 @ ( powerset @ X33 ) ) ) ) )
=> ( ! [X35: $i,X36: $i] :
( ( in @ X36 @ ( powerset @ X35 ) )
=> ! [X37: $i] :
( ( in @ X37 @ ( powerset @ X35 ) )
=> ! [X38: $i] :
( ( in @ X38 @ ( powerset @ X35 ) )
=> ! [X39: $i] :
( ( in @ X39 @ X35 )
=> ( ( in @ X39 @ ( binintersect @ X36 @ X37 ) )
=> ( in @ X39 @ ( binintersect @ ( binunion @ X36 @ X38 ) @ ( binunion @ X37 @ X38 ) ) ) ) ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ ( binintersect @ ( binunion @ X2 @ X5 ) @ ( binunion @ X3 @ X5 ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[intersectInPowersetIntersectUnions]),binintersectT_lem]),binunionT_lem]),powersetTI1]),inIntersectImpInIntersectUnions]) ).
thf(c_0_6,negated_conjecture,
! [X40: $i,X41: $i,X42: $i,X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i,X50: $i,X51: $i,X52: $i,X53: $i,X54: $i] :
( ( ~ ( in @ X41 @ ( powerset @ X40 ) )
| ~ ( in @ X42 @ ( powerset @ X40 ) )
| ( in @ ( binintersect @ X41 @ X42 ) @ ( powerset @ X40 ) ) )
& ( ~ ( in @ X44 @ ( powerset @ X43 ) )
| ~ ( in @ X45 @ ( powerset @ X43 ) )
| ( in @ ( binunion @ X44 @ X45 ) @ ( powerset @ X43 ) ) )
& ( ( in @ ( esk1_3 @ X46 @ X47 @ X48 ) @ X46 )
| ( in @ X47 @ ( powerset @ X48 ) )
| ~ ( in @ X48 @ ( powerset @ X46 ) )
| ~ ( in @ X47 @ ( powerset @ X46 ) ) )
& ( ( in @ ( esk1_3 @ X46 @ X47 @ X48 ) @ X47 )
| ( in @ X47 @ ( powerset @ X48 ) )
| ~ ( in @ X48 @ ( powerset @ X46 ) )
| ~ ( in @ X47 @ ( powerset @ X46 ) ) )
& ( ~ ( in @ ( esk1_3 @ X46 @ X47 @ X48 ) @ X48 )
| ( in @ X47 @ ( powerset @ X48 ) )
| ~ ( in @ X48 @ ( powerset @ X46 ) )
| ~ ( in @ X47 @ ( powerset @ X46 ) ) )
& ( ~ ( in @ X51 @ ( powerset @ X50 ) )
| ~ ( in @ X52 @ ( powerset @ X50 ) )
| ~ ( in @ X53 @ ( powerset @ X50 ) )
| ~ ( in @ X54 @ X50 )
| ~ ( in @ X54 @ ( binintersect @ X51 @ X52 ) )
| ( in @ X54 @ ( binintersect @ ( binunion @ X51 @ X53 ) @ ( binunion @ X52 @ X53 ) ) ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk5_0 @ ( powerset @ esk2_0 ) )
& ~ ( in @ ( binintersect @ esk3_0 @ esk4_0 ) @ ( powerset @ ( binintersect @ ( binunion @ esk3_0 @ esk5_0 ) @ ( binunion @ 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_5])])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i,X1: $i,X4: $i,X5: $i,X3: $i] :
( ( in @ X5 @ ( binintersect @ ( binunion @ X1 @ X4 ) @ ( binunion @ X3 @ X4 ) ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X4 @ ( powerset @ X2 ) )
| ~ ( in @ X5 @ X2 )
| ~ ( in @ X5 @ ( binintersect @ X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
in @ esk5_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X3 )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X1 @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) )
| ~ ( in @ X1 @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i] :
( ( in @ X1 @ ( powerset @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) ) )
| ~ ( in @ ( esk1_3 @ X4 @ X1 @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) ) @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ ( esk1_3 @ X4 @ X1 @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) ) @ esk2_0 )
| ~ ( in @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) @ ( powerset @ X4 ) )
| ~ ( in @ X3 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ ( powerset @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X2 )
| ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( binintersect @ X1 @ X2 ) @ ( powerset @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) ) )
| ~ ( in @ ( esk1_3 @ X3 @ ( binintersect @ X1 @ X2 ) @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) ) @ esk2_0 )
| ~ ( in @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) @ ( powerset @ X3 ) )
| ~ ( in @ ( binintersect @ X1 @ X2 ) @ ( powerset @ X3 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk2_0 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X1 )
| ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( binintersect @ X1 @ X3 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_16,negated_conjecture,
~ ( in @ ( binintersect @ esk3_0 @ esk4_0 ) @ ( powerset @ ( binintersect @ ( binunion @ esk3_0 @ esk5_0 ) @ ( binunion @ esk4_0 @ esk5_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( binintersect @ X1 @ X2 ) @ ( powerset @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) ) )
| ~ ( in @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) @ ( powerset @ esk2_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk2_0 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_18,negated_conjecture,
in @ esk4_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_19,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_20,negated_conjecture,
~ ( in @ ( binintersect @ ( binunion @ esk3_0 @ esk5_0 ) @ ( binunion @ esk4_0 @ esk5_0 ) ) @ ( powerset @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_21,negated_conjecture,
( ~ ( in @ ( binunion @ esk4_0 @ esk5_0 ) @ ( powerset @ esk2_0 ) )
| ~ ( in @ ( binunion @ esk3_0 @ esk5_0 ) @ ( powerset @ esk2_0 ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( binunion @ X1 @ X3 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_23,negated_conjecture,
~ ( in @ ( binunion @ esk4_0 @ esk5_0 ) @ ( powerset @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_8]),c_0_19])]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_8]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU743^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n015.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sun May 19 16:35:38 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.51 Running higher-order theorem proving
% 0.23/0.51 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
% 3.52/0.94 # Version: 3.1.0-ho
% 3.52/0.94 # Preprocessing class: HSSSSLSSSLSNFFN.
% 3.52/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.52/0.94 # Starting lpo6_lambda_fix with 1500s (5) cores
% 3.52/0.94 # Starting post_as_ho8 with 300s (1) cores
% 3.52/0.94 # Starting post_as_ho3 with 300s (1) cores
% 3.52/0.94 # Starting post_as_ho2 with 300s (1) cores
% 3.52/0.94 # post_as_ho3 with pid 5046 completed with status 0
% 3.52/0.94 # Result found by post_as_ho3
% 3.52/0.94 # Preprocessing class: HSSSSLSSSLSNFFN.
% 3.52/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.52/0.94 # Starting lpo6_lambda_fix with 1500s (5) cores
% 3.52/0.94 # Starting post_as_ho8 with 300s (1) cores
% 3.52/0.94 # Starting post_as_ho3 with 300s (1) cores
% 3.52/0.94 # No SInE strategy applied
% 3.52/0.94 # Search class: HGUNF-FFSS32-MFFFMFNN
% 3.52/0.94 # partial match(2): HGUNF-FFSF32-SFFFMFNN
% 3.52/0.94 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.52/0.94 # Starting new_ho_10 with 163s (1) cores
% 3.52/0.94 # new_ho_10 with pid 5051 completed with status 0
% 3.52/0.94 # Result found by new_ho_10
% 3.52/0.94 # Preprocessing class: HSSSSLSSSLSNFFN.
% 3.52/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.52/0.94 # Starting lpo6_lambda_fix with 1500s (5) cores
% 3.52/0.94 # Starting post_as_ho8 with 300s (1) cores
% 3.52/0.94 # Starting post_as_ho3 with 300s (1) cores
% 3.52/0.94 # No SInE strategy applied
% 3.52/0.94 # Search class: HGUNF-FFSS32-MFFFMFNN
% 3.52/0.94 # partial match(2): HGUNF-FFSF32-SFFFMFNN
% 3.52/0.94 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.52/0.94 # Starting new_ho_10 with 163s (1) cores
% 3.52/0.94 # Preprocessing time : 0.001 s
% 3.52/0.94 # Presaturation interreduction done
% 3.52/0.94
% 3.52/0.94 # Proof found!
% 3.52/0.94 # SZS status Theorem
% 3.52/0.94 # SZS output start CNFRefutation
% See solution above
% 3.52/0.94 # Parsed axioms : 13
% 3.52/0.94 # Removed by relevancy pruning/SinE : 0
% 3.52/0.94 # Initial clauses : 18
% 3.52/0.94 # Removed in clause preprocessing : 8
% 3.52/0.94 # Initial clauses in saturation : 10
% 3.52/0.94 # Processed clauses : 421
% 3.52/0.94 # ...of these trivial : 0
% 3.52/0.94 # ...subsumed : 69
% 3.52/0.94 # ...remaining for further processing : 352
% 3.52/0.94 # Other redundant clauses eliminated : 0
% 3.52/0.94 # Clauses deleted for lack of memory : 0
% 3.52/0.94 # Backward-subsumed : 1
% 3.52/0.94 # Backward-rewritten : 0
% 3.52/0.94 # Generated clauses : 6892
% 3.52/0.94 # ...of the previous two non-redundant : 6887
% 3.52/0.94 # ...aggressively subsumed : 0
% 3.52/0.94 # Contextual simplify-reflections : 3
% 3.52/0.94 # Paramodulations : 6892
% 3.52/0.94 # Factorizations : 0
% 3.52/0.94 # NegExts : 0
% 3.52/0.94 # Equation resolutions : 0
% 3.52/0.94 # Disequality decompositions : 0
% 3.52/0.94 # Total rewrite steps : 9
% 3.52/0.94 # ...of those cached : 3
% 3.52/0.94 # Propositional unsat checks : 0
% 3.52/0.94 # Propositional check models : 0
% 3.52/0.94 # Propositional check unsatisfiable : 0
% 3.52/0.94 # Propositional clauses : 0
% 3.52/0.94 # Propositional clauses after purity: 0
% 3.52/0.94 # Propositional unsat core size : 0
% 3.52/0.94 # Propositional preprocessing time : 0.000
% 3.52/0.94 # Propositional encoding time : 0.000
% 3.52/0.94 # Propositional solver time : 0.000
% 3.52/0.94 # Success case prop preproc time : 0.000
% 3.52/0.94 # Success case prop encoding time : 0.000
% 3.52/0.94 # Success case prop solver time : 0.000
% 3.52/0.94 # Current number of processed clauses : 341
% 3.52/0.94 # Positive orientable unit clauses : 6
% 3.52/0.94 # Positive unorientable unit clauses: 0
% 3.52/0.94 # Negative unit clauses : 3
% 3.52/0.94 # Non-unit-clauses : 332
% 3.52/0.94 # Current number of unprocessed clauses: 6486
% 3.52/0.94 # ...number of literals in the above : 77315
% 3.52/0.94 # Current number of archived formulas : 0
% 3.52/0.94 # Current number of archived clauses : 11
% 3.52/0.94 # Clause-clause subsumption calls (NU) : 98042
% 3.52/0.94 # Rec. Clause-clause subsumption calls : 5573
% 3.52/0.94 # Non-unit clause-clause subsumptions : 72
% 3.52/0.94 # Unit Clause-clause subsumption calls : 30
% 3.52/0.94 # Rewrite failures with RHS unbound : 0
% 3.52/0.94 # BW rewrite match attempts : 0
% 3.52/0.94 # BW rewrite match successes : 0
% 3.52/0.94 # Condensation attempts : 421
% 3.52/0.94 # Condensation successes : 0
% 3.52/0.94 # Termbank termtop insertions : 865680
% 3.52/0.94 # Search garbage collected termcells : 590
% 3.52/0.94
% 3.52/0.94 # -------------------------------------------------
% 3.52/0.94 # User time : 0.397 s
% 3.52/0.94 # System time : 0.009 s
% 3.52/0.94 # Total time : 0.406 s
% 3.52/0.94 # Maximum resident set size: 1884 pages
% 3.52/0.94
% 3.52/0.94 # -------------------------------------------------
% 3.52/0.94 # User time : 0.398 s
% 3.52/0.94 # System time : 0.011 s
% 3.52/0.94 # Total time : 0.410 s
% 3.52/0.94 # Maximum resident set size: 1708 pages
% 3.52/0.94 % E---3.1 exiting
% 3.52/0.94 % E exiting
%------------------------------------------------------------------------------