TSTP Solution File: SEU238+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU238+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:31:06 EDT 2023
% Result : Theorem 462.82s 59.10s
% Output : CNFRefutation 462.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 58 ( 11 unt; 0 def)
% Number of atoms : 211 ( 17 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 262 ( 109 ~; 95 |; 34 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 75 ( 0 sgn; 42 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',antisymmetry_r2_hidden) ).
fof(t10_ordinal1,lemma,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',t10_ordinal1) ).
fof(t41_ordinal1,lemma,
! [X1] :
( ordinal(X1)
=> ( being_limit_ordinal(X1)
<=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
=> in(succ(X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',t41_ordinal1) ).
fof(t23_ordinal1,lemma,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',t23_ordinal1) ).
fof(t42_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',t42_ordinal1) ).
fof(t33_ordinal1,lemma,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',t33_ordinal1) ).
fof(d8_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',d8_xboole_0) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',redefinition_r1_ordinal1) ).
fof(t21_ordinal1,lemma,
! [X1] :
( epsilon_transitive(X1)
=> ! [X2] :
( ordinal(X2)
=> ( proper_subset(X1,X2)
=> in(X1,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',t21_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',cc1_ordinal1) ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p',fc3_ordinal1) ).
fof(c_0_11,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(c_0_12,plain,
! [X64,X65] :
( ~ in(X64,X65)
| ~ in(X65,X64) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_13,lemma,
! [X17] : in(X17,succ(X17)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
fof(c_0_14,lemma,
! [X11,X12] :
( ( ~ being_limit_ordinal(X11)
| ~ ordinal(X12)
| ~ in(X12,X11)
| in(succ(X12),X11)
| ~ ordinal(X11) )
& ( ordinal(esk3_1(X11))
| being_limit_ordinal(X11)
| ~ ordinal(X11) )
& ( in(esk3_1(X11),X11)
| being_limit_ordinal(X11)
| ~ ordinal(X11) )
& ( ~ in(succ(esk3_1(X11)),X11)
| being_limit_ordinal(X11)
| ~ ordinal(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t41_ordinal1])])])])]) ).
fof(c_0_15,lemma,
! [X36,X37] :
( ~ ordinal(X37)
| ~ in(X36,X37)
| ordinal(X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_ordinal1])]) ).
cnf(c_0_16,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,lemma,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,lemma,
( in(succ(X2),X1)
| ~ being_limit_ordinal(X1)
| ~ ordinal(X2)
| ~ in(X2,X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,lemma,
( ordinal(X2)
| ~ ordinal(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t42_ordinal1])]) ).
cnf(c_0_21,lemma,
~ in(succ(X1),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,lemma,
( in(succ(X1),X2)
| ~ being_limit_ordinal(X2)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,lemma,
! [X18,X19] :
( ( ~ in(X18,X19)
| ordinal_subset(succ(X18),X19)
| ~ ordinal(X19)
| ~ ordinal(X18) )
& ( ~ ordinal_subset(succ(X18),X19)
| in(X18,X19)
| ~ ordinal(X19)
| ~ ordinal(X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_ordinal1])])])]) ).
fof(c_0_24,negated_conjecture,
! [X8] :
( ordinal(esk1_0)
& ( ordinal(esk2_0)
| ~ being_limit_ordinal(esk1_0) )
& ( esk1_0 = succ(esk2_0)
| ~ being_limit_ordinal(esk1_0) )
& ( being_limit_ordinal(esk1_0)
| ~ being_limit_ordinal(esk1_0) )
& ( ordinal(esk2_0)
| ~ ordinal(X8)
| esk1_0 != succ(X8) )
& ( esk1_0 = succ(esk2_0)
| ~ ordinal(X8)
| esk1_0 != succ(X8) )
& ( being_limit_ordinal(esk1_0)
| ~ ordinal(X8)
| esk1_0 != succ(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])]) ).
cnf(c_0_25,lemma,
( ~ being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(X1,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,lemma,
( ordinal_subset(succ(X1),X2)
| ~ in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,lemma,
( in(esk3_1(X1),X1)
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,lemma,
( ordinal(esk3_1(X1))
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,lemma,
( ~ being_limit_ordinal(succ(X1))
| ~ ordinal(succ(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_17])]) ).
cnf(c_0_31,negated_conjecture,
( esk1_0 = succ(esk2_0)
| ~ being_limit_ordinal(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X428,X429] :
( ( subset(X428,X429)
| ~ proper_subset(X428,X429) )
& ( X428 != X429
| ~ proper_subset(X428,X429) )
& ( ~ subset(X428,X429)
| X428 = X429
| proper_subset(X428,X429) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_xboole_0])])]) ).
fof(c_0_33,plain,
! [X30,X31] :
( ( ~ ordinal_subset(X30,X31)
| subset(X30,X31)
| ~ ordinal(X30)
| ~ ordinal(X31) )
& ( ~ subset(X30,X31)
| ordinal_subset(X30,X31)
| ~ ordinal(X30)
| ~ ordinal(X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_34,lemma,
( ordinal_subset(succ(X1),X2)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_35,negated_conjecture,
( being_limit_ordinal(esk1_0)
| in(esk3_1(esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( being_limit_ordinal(esk1_0)
| ordinal(esk3_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
~ being_limit_ordinal(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]) ).
fof(c_0_38,lemma,
! [X34,X35] :
( ~ epsilon_transitive(X34)
| ~ ordinal(X35)
| ~ proper_subset(X34,X35)
| in(X34,X35) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_ordinal1])])]) ).
cnf(c_0_39,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( being_limit_ordinal(esk1_0)
| ordinal_subset(succ(esk3_1(esk1_0)),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_28])]) ).
cnf(c_0_42,negated_conjecture,
( being_limit_ordinal(esk1_0)
| ~ ordinal(X1)
| esk1_0 != succ(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_43,negated_conjecture,
ordinal(esk3_1(esk1_0)),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,lemma,
( being_limit_ordinal(X1)
| ~ in(succ(esk3_1(X1)),X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,lemma,
( in(X1,X2)
| ~ epsilon_transitive(X1)
| ~ ordinal(X2)
| ~ proper_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
ordinal_subset(succ(esk3_1(esk1_0)),esk1_0),
inference(sr,[status(thm)],[c_0_41,c_0_37]) ).
cnf(c_0_48,negated_conjecture,
succ(esk3_1(esk1_0)) != esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37]) ).
fof(c_0_49,plain,
! [X20] :
( ( epsilon_transitive(X20)
| ~ ordinal(X20) )
& ( epsilon_connected(X20)
| ~ ordinal(X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
fof(c_0_50,plain,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc3_ordinal1]) ).
cnf(c_0_51,lemma,
( being_limit_ordinal(X1)
| ~ epsilon_transitive(succ(esk3_1(X1)))
| ~ ordinal(X1)
| ~ proper_subset(succ(esk3_1(X1)),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( proper_subset(succ(esk3_1(esk1_0)),esk1_0)
| ~ ordinal(succ(esk3_1(esk1_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_28])]),c_0_48]) ).
cnf(c_0_53,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
fof(c_0_54,plain,
! [X16] :
( ( ~ empty(succ(X16))
| ~ ordinal(X16) )
& ( epsilon_transitive(succ(X16))
| ~ ordinal(X16) )
& ( epsilon_connected(succ(X16))
| ~ ordinal(X16) )
& ( ordinal(succ(X16))
| ~ ordinal(X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])]) ).
cnf(c_0_55,negated_conjecture,
~ ordinal(succ(esk3_1(esk1_0))),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_28])]),c_0_37]),c_0_53]) ).
cnf(c_0_56,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU238+2 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:44:21 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.SKLEtH55VS/E---3.1_7606.p
% 462.82/59.10 # Version: 3.1pre001
% 462.82/59.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 462.82/59.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 462.82/59.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 462.82/59.10 # Starting new_bool_3 with 300s (1) cores
% 462.82/59.10 # Starting new_bool_1 with 300s (1) cores
% 462.82/59.10 # Starting sh5l with 300s (1) cores
% 462.82/59.10 # sh5l with pid 7686 completed with status 0
% 462.82/59.10 # Result found by sh5l
% 462.82/59.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 462.82/59.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 462.82/59.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 462.82/59.10 # Starting new_bool_3 with 300s (1) cores
% 462.82/59.10 # Starting new_bool_1 with 300s (1) cores
% 462.82/59.10 # Starting sh5l with 300s (1) cores
% 462.82/59.10 # SinE strategy is gf500_gu_R04_F100_L20000
% 462.82/59.10 # Search class: FGHSM-FSLM32-MFFFFFNN
% 462.82/59.10 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 462.82/59.10 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 462.82/59.10 # G-E--_303_C18_F1_URBAN_S0Y with pid 7689 completed with status 7
% 462.82/59.10 # Starting sh5l with 31s (1) cores
% 462.82/59.10 # sh5l with pid 7699 completed with status 7
% 462.82/59.10 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 462.82/59.10 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 7703 completed with status 0
% 462.82/59.10 # Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 462.82/59.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 462.82/59.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 462.82/59.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 462.82/59.10 # Starting new_bool_3 with 300s (1) cores
% 462.82/59.10 # Starting new_bool_1 with 300s (1) cores
% 462.82/59.10 # Starting sh5l with 300s (1) cores
% 462.82/59.10 # SinE strategy is gf500_gu_R04_F100_L20000
% 462.82/59.10 # Search class: FGHSM-FSLM32-MFFFFFNN
% 462.82/59.10 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 462.82/59.10 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 462.82/59.10 # G-E--_303_C18_F1_URBAN_S0Y with pid 7689 completed with status 7
% 462.82/59.10 # Starting sh5l with 31s (1) cores
% 462.82/59.10 # sh5l with pid 7699 completed with status 7
% 462.82/59.10 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 462.82/59.10 # Preprocessing time : 0.007 s
% 462.82/59.10 # Presaturation interreduction done
% 462.82/59.10
% 462.82/59.10 # Proof found!
% 462.82/59.10 # SZS status Theorem
% 462.82/59.10 # SZS output start CNFRefutation
% See solution above
% 462.82/59.10 # Parsed axioms : 280
% 462.82/59.10 # Removed by relevancy pruning/SinE : 26
% 462.82/59.10 # Initial clauses : 527
% 462.82/59.10 # Removed in clause preprocessing : 5
% 462.82/59.10 # Initial clauses in saturation : 522
% 462.82/59.10 # Processed clauses : 12124
% 462.82/59.10 # ...of these trivial : 103
% 462.82/59.10 # ...subsumed : 7541
% 462.82/59.10 # ...remaining for further processing : 4480
% 462.82/59.10 # Other redundant clauses eliminated : 178
% 462.82/59.10 # Clauses deleted for lack of memory : 0
% 462.82/59.10 # Backward-subsumed : 574
% 462.82/59.10 # Backward-rewritten : 199
% 462.82/59.10 # Generated clauses : 49689
% 462.82/59.10 # ...of the previous two non-redundant : 41563
% 462.82/59.10 # ...aggressively subsumed : 0
% 462.82/59.10 # Contextual simplify-reflections : 205
% 462.82/59.10 # Paramodulations : 49487
% 462.82/59.10 # Factorizations : 14
% 462.82/59.10 # NegExts : 0
% 462.82/59.10 # Equation resolutions : 184
% 462.82/59.10 # Total rewrite steps : 22941
% 462.82/59.10 # Propositional unsat checks : 0
% 462.82/59.10 # Propositional check models : 0
% 462.82/59.10 # Propositional check unsatisfiable : 0
% 462.82/59.10 # Propositional clauses : 0
% 462.82/59.10 # Propositional clauses after purity: 0
% 462.82/59.10 # Propositional unsat core size : 0
% 462.82/59.10 # Propositional preprocessing time : 0.000
% 462.82/59.10 # Propositional encoding time : 0.000
% 462.82/59.10 # Propositional solver time : 0.000
% 462.82/59.10 # Success case prop preproc time : 0.000
% 462.82/59.10 # Success case prop encoding time : 0.000
% 462.82/59.10 # Success case prop solver time : 0.000
% 462.82/59.10 # Current number of processed clauses : 3143
% 462.82/59.10 # Positive orientable unit clauses : 244
% 462.82/59.10 # Positive unorientable unit clauses: 5
% 462.82/59.10 # Negative unit clauses : 209
% 462.82/59.10 # Non-unit-clauses : 2685
% 462.82/59.10 # Current number of unprocessed clauses: 29747
% 462.82/59.10 # ...number of literals in the above : 102586
% 462.82/59.10 # Current number of archived formulas : 0
% 462.82/59.10 # Current number of archived clauses : 1255
% 462.82/59.10 # Clause-clause subsumption calls (NU) : 2141494
% 462.82/59.10 # Rec. Clause-clause subsumption calls : 1495097
% 462.82/59.10 # Non-unit clause-clause subsumptions : 5587
% 462.82/59.10 # Unit Clause-clause subsumption calls : 198779
% 462.82/59.10 # Rewrite failures with RHS unbound : 0
% 462.82/59.10 # BW rewrite match attempts : 215
% 462.82/59.10 # BW rewrite match successes : 112
% 462.82/59.10 # Condensation attempts : 0
% 462.82/59.10 # Condensation successes : 0
% 462.82/59.10 # Termbank termtop insertions : 621927
% 462.82/59.10
% 462.82/59.10 # -------------------------------------------------
% 462.82/59.10 # User time : 57.075 s
% 462.82/59.10 # System time : 0.560 s
% 462.82/59.10 # Total time : 57.636 s
% 462.82/59.10 # Maximum resident set size: 3704 pages
% 462.82/59.10
% 462.82/59.10 # -------------------------------------------------
% 462.82/59.10 # User time : 57.087 s
% 462.82/59.10 # System time : 0.560 s
% 462.82/59.10 # Total time : 57.647 s
% 462.82/59.10 # Maximum resident set size: 1976 pages
% 462.82/59.10 % E---3.1 exiting
%------------------------------------------------------------------------------