TSTP Solution File: SEU185+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU185+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:25:08 EDT 2023
% Result : Theorem 498.56s 64.16s
% Output : CNFRefutation 498.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 5 unt; 0 def)
% Number of atoms : 255 ( 65 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 368 ( 158 ~; 166 |; 21 &)
% ( 8 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 2 con; 0-5 aty)
% Number of variables : 144 ( 2 sgn; 58 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d8_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( relation(X3)
=> ( X3 = relation_composition(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ? [X6] :
( in(ordered_pair(X4,X6),X1)
& in(ordered_pair(X6,X5),X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',d8_relat_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',d5_relat_1) ).
fof(t47_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(relation_dom(X1),relation_rng(X2))
=> relation_rng(relation_composition(X2,X1)) = relation_rng(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',t47_relat_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',d3_tarski) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',d4_relat_1) ).
fof(dt_k5_relat_1,axiom,
! [X1,X2] :
( ( relation(X1)
& relation(X2) )
=> relation(relation_composition(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',dt_k5_relat_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',d10_xboole_0) ).
fof(t45_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> subset(relation_rng(relation_composition(X1,X2)),relation_rng(X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p',t45_relat_1) ).
fof(c_0_8,plain,
! [X21,X22,X23,X24,X25,X27,X28,X29,X32] :
( ( in(ordered_pair(X24,esk6_5(X21,X22,X23,X24,X25)),X21)
| ~ in(ordered_pair(X24,X25),X23)
| X23 != relation_composition(X21,X22)
| ~ relation(X23)
| ~ relation(X22)
| ~ relation(X21) )
& ( in(ordered_pair(esk6_5(X21,X22,X23,X24,X25),X25),X22)
| ~ in(ordered_pair(X24,X25),X23)
| X23 != relation_composition(X21,X22)
| ~ relation(X23)
| ~ relation(X22)
| ~ relation(X21) )
& ( ~ in(ordered_pair(X27,X29),X21)
| ~ in(ordered_pair(X29,X28),X22)
| in(ordered_pair(X27,X28),X23)
| X23 != relation_composition(X21,X22)
| ~ relation(X23)
| ~ relation(X22)
| ~ relation(X21) )
& ( ~ in(ordered_pair(esk7_3(X21,X22,X23),esk8_3(X21,X22,X23)),X23)
| ~ in(ordered_pair(esk7_3(X21,X22,X23),X32),X21)
| ~ in(ordered_pair(X32,esk8_3(X21,X22,X23)),X22)
| X23 = relation_composition(X21,X22)
| ~ relation(X23)
| ~ relation(X22)
| ~ relation(X21) )
& ( in(ordered_pair(esk7_3(X21,X22,X23),esk9_3(X21,X22,X23)),X21)
| in(ordered_pair(esk7_3(X21,X22,X23),esk8_3(X21,X22,X23)),X23)
| X23 = relation_composition(X21,X22)
| ~ relation(X23)
| ~ relation(X22)
| ~ relation(X21) )
& ( in(ordered_pair(esk9_3(X21,X22,X23),esk8_3(X21,X22,X23)),X22)
| in(ordered_pair(esk7_3(X21,X22,X23),esk8_3(X21,X22,X23)),X23)
| X23 = relation_composition(X21,X22)
| ~ relation(X23)
| ~ relation(X22)
| ~ relation(X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_relat_1])])])])])]) ).
fof(c_0_9,plain,
! [X9,X10,X11,X13,X14,X15,X17] :
( ( ~ in(X11,X10)
| in(ordered_pair(esk3_3(X9,X10,X11),X11),X9)
| X10 != relation_rng(X9)
| ~ relation(X9) )
& ( ~ in(ordered_pair(X14,X13),X9)
| in(X13,X10)
| X10 != relation_rng(X9)
| ~ relation(X9) )
& ( ~ in(esk4_2(X9,X15),X15)
| ~ in(ordered_pair(X17,esk4_2(X9,X15)),X9)
| X15 = relation_rng(X9)
| ~ relation(X9) )
& ( in(esk4_2(X9,X15),X15)
| in(ordered_pair(esk5_2(X9,X15),esk4_2(X9,X15)),X9)
| X15 = relation_rng(X9)
| ~ relation(X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_relat_1])])])])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(relation_dom(X1),relation_rng(X2))
=> relation_rng(relation_composition(X2,X1)) = relation_rng(X1) ) ) ),
inference(assume_negation,[status(cth)],[t47_relat_1]) ).
cnf(c_0_11,plain,
( in(ordered_pair(X1,X4),X6)
| ~ in(ordered_pair(X1,X2),X3)
| ~ in(ordered_pair(X2,X4),X5)
| X6 != relation_composition(X3,X5)
| ~ relation(X6)
| ~ relation(X5)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( in(ordered_pair(esk3_3(X3,X2,X1),X1),X3)
| ~ in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X38,X39,X40,X41,X42] :
( ( ~ subset(X38,X39)
| ~ in(X40,X38)
| in(X40,X39) )
& ( in(esk10_2(X41,X42),X41)
| subset(X41,X42) )
& ( ~ in(esk10_2(X41,X42),X42)
| subset(X41,X42) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
fof(c_0_14,negated_conjecture,
( relation(esk1_0)
& relation(esk2_0)
& subset(relation_dom(esk1_0),relation_rng(esk2_0))
& relation_rng(relation_composition(esk2_0,esk1_0)) != relation_rng(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_15,plain,
! [X47,X48,X49,X51,X52,X53,X55] :
( ( ~ in(X49,X48)
| in(ordered_pair(X49,esk11_3(X47,X48,X49)),X47)
| X48 != relation_dom(X47)
| ~ relation(X47) )
& ( ~ in(ordered_pair(X51,X52),X47)
| in(X51,X48)
| X48 != relation_dom(X47)
| ~ relation(X47) )
& ( ~ in(esk12_2(X47,X53),X53)
| ~ in(ordered_pair(esk12_2(X47,X53),X55),X47)
| X53 = relation_dom(X47)
| ~ relation(X47) )
& ( in(esk12_2(X47,X53),X53)
| in(ordered_pair(esk12_2(X47,X53),esk13_2(X47,X53)),X47)
| X53 = relation_dom(X47)
| ~ relation(X47) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_relat_1])])])])])]) ).
cnf(c_0_16,plain,
( in(ordered_pair(X1,X2),X3)
| X3 != relation_composition(X4,X5)
| X6 != relation_rng(X5)
| ~ relation(X3)
| ~ relation(X5)
| ~ relation(X4)
| ~ in(ordered_pair(X1,esk3_3(X5,X6,X2)),X4)
| ~ in(X2,X6) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
subset(relation_dom(esk1_0),relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( in(X1,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( in(ordered_pair(esk3_3(X1,X2,esk3_3(X3,X4,X5)),X5),X6)
| X6 != relation_composition(X1,X3)
| X4 != relation_rng(X3)
| X2 != relation_rng(X1)
| ~ relation(X6)
| ~ relation(X3)
| ~ relation(X1)
| ~ in(esk3_3(X3,X4,X5),X2)
| ~ in(X5,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_22,negated_conjecture,
( in(X1,relation_rng(esk2_0))
| ~ in(X1,relation_dom(esk1_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( in(esk3_3(X1,X2,X3),X4)
| X4 != relation_dom(X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,plain,
( in(X1,X2)
| X3 != relation_composition(X4,X5)
| X2 != relation_rng(X3)
| X6 != relation_rng(X5)
| X7 != relation_rng(X4)
| ~ relation(X3)
| ~ relation(X5)
| ~ relation(X4)
| ~ in(esk3_3(X5,X6,X1),X7)
| ~ in(X1,X6) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( in(esk3_3(X1,X2,X3),relation_rng(esk2_0))
| relation_dom(esk1_0) != relation_dom(X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X34,X35] :
( ~ relation(X34)
| ~ relation(X35)
| relation(relation_composition(X34,X35)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])]) ).
cnf(c_0_27,negated_conjecture,
( in(X1,X2)
| relation_rng(esk2_0) != relation_rng(X3)
| relation_dom(esk1_0) != relation_dom(X4)
| X5 != relation_composition(X3,X4)
| X2 != relation_rng(X5)
| X6 != relation_rng(X4)
| ~ relation(X5)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(X1,X6) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( in(X1,X2)
| relation_rng(esk2_0) != relation_rng(X3)
| relation_dom(esk1_0) != relation_dom(X4)
| X2 != relation_rng(relation_composition(X3,X4))
| X5 != relation_rng(X4)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(X1,X5) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_28]) ).
fof(c_0_30,plain,
! [X36,X37] :
( ( subset(X36,X37)
| X36 != X37 )
& ( subset(X37,X36)
| X36 != X37 )
& ( ~ subset(X36,X37)
| ~ subset(X37,X36)
| X36 = X37 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
fof(c_0_31,plain,
! [X19,X20] :
( ~ relation(X19)
| ~ relation(X20)
| subset(relation_rng(relation_composition(X19,X20)),relation_rng(X20)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t45_relat_1])])]) ).
cnf(c_0_32,negated_conjecture,
( in(X1,relation_rng(relation_composition(X2,X3)))
| relation_rng(esk2_0) != relation_rng(X2)
| relation_dom(esk1_0) != relation_dom(X3)
| X4 != relation_rng(X3)
| ~ relation(X3)
| ~ relation(X2)
| ~ in(X1,X4) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
( in(esk10_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( subset(relation_rng(relation_composition(X1,X2)),relation_rng(X2))
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( subset(X1,X2)
| ~ in(esk10_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,negated_conjecture,
( subset(X1,X2)
| in(esk10_2(X1,X2),relation_rng(relation_composition(X3,X4)))
| relation_rng(esk2_0) != relation_rng(X3)
| relation_dom(esk1_0) != relation_dom(X4)
| X1 != relation_rng(X4)
| ~ relation(X4)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( relation_rng(relation_composition(X1,X2)) = relation_rng(X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ subset(relation_rng(X2),relation_rng(relation_composition(X1,X2))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( subset(X1,relation_rng(relation_composition(X2,X3)))
| relation_rng(esk2_0) != relation_rng(X2)
| relation_dom(esk1_0) != relation_dom(X3)
| X1 != relation_rng(X3)
| ~ relation(X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
relation_rng(relation_composition(esk2_0,esk1_0)) != relation_rng(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,negated_conjecture,
( relation_rng(relation_composition(X1,X2)) = relation_rng(X2)
| relation_rng(esk2_0) != relation_rng(X1)
| relation_dom(esk1_0) != relation_dom(X2)
| ~ relation(X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SEU185+1 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 08:30:46 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0ChfYqapsQ/E---3.1_9262.p
% 498.56/64.16 # Version: 3.1pre001
% 498.56/64.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 498.56/64.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 498.56/64.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 498.56/64.16 # Starting new_bool_3 with 300s (1) cores
% 498.56/64.16 # Starting new_bool_1 with 300s (1) cores
% 498.56/64.16 # Starting sh5l with 300s (1) cores
% 498.56/64.16 # sh5l with pid 9343 completed with status 0
% 498.56/64.16 # Result found by sh5l
% 498.56/64.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 498.56/64.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 498.56/64.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 498.56/64.16 # Starting new_bool_3 with 300s (1) cores
% 498.56/64.16 # Starting new_bool_1 with 300s (1) cores
% 498.56/64.16 # Starting sh5l with 300s (1) cores
% 498.56/64.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 498.56/64.16 # Search class: FGHSM-FFMM32-SFFFFFNN
% 498.56/64.16 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 498.56/64.16 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 498.56/64.16 # G-E--_301_C18_F1_URBAN_S0Y with pid 9346 completed with status 0
% 498.56/64.16 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 498.56/64.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 498.56/64.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 498.56/64.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 498.56/64.16 # Starting new_bool_3 with 300s (1) cores
% 498.56/64.16 # Starting new_bool_1 with 300s (1) cores
% 498.56/64.16 # Starting sh5l with 300s (1) cores
% 498.56/64.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 498.56/64.16 # Search class: FGHSM-FFMM32-SFFFFFNN
% 498.56/64.16 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 498.56/64.16 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 498.56/64.16 # Preprocessing time : 0.002 s
% 498.56/64.16
% 498.56/64.16 # Proof found!
% 498.56/64.16 # SZS status Theorem
% 498.56/64.16 # SZS output start CNFRefutation
% See solution above
% 498.56/64.16 # Parsed axioms : 39
% 498.56/64.16 # Removed by relevancy pruning/SinE : 10
% 498.56/64.16 # Initial clauses : 51
% 498.56/64.16 # Removed in clause preprocessing : 0
% 498.56/64.16 # Initial clauses in saturation : 51
% 498.56/64.16 # Processed clauses : 21890
% 498.56/64.16 # ...of these trivial : 288
% 498.56/64.16 # ...subsumed : 12303
% 498.56/64.16 # ...remaining for further processing : 9299
% 498.56/64.16 # Other redundant clauses eliminated : 2
% 498.56/64.16 # Clauses deleted for lack of memory : 0
% 498.56/64.16 # Backward-subsumed : 1040
% 498.56/64.16 # Backward-rewritten : 66
% 498.56/64.16 # Generated clauses : 1346288
% 498.56/64.16 # ...of the previous two non-redundant : 1324139
% 498.56/64.16 # ...aggressively subsumed : 0
% 498.56/64.16 # Contextual simplify-reflections : 325
% 498.56/64.16 # Paramodulations : 1343954
% 498.56/64.16 # Factorizations : 33
% 498.56/64.16 # NegExts : 0
% 498.56/64.16 # Equation resolutions : 2288
% 498.56/64.16 # Total rewrite steps : 246266
% 498.56/64.16 # Propositional unsat checks : 0
% 498.56/64.16 # Propositional check models : 0
% 498.56/64.16 # Propositional check unsatisfiable : 0
% 498.56/64.16 # Propositional clauses : 0
% 498.56/64.16 # Propositional clauses after purity: 0
% 498.56/64.16 # Propositional unsat core size : 0
% 498.56/64.16 # Propositional preprocessing time : 0.000
% 498.56/64.16 # Propositional encoding time : 0.000
% 498.56/64.16 # Propositional solver time : 0.000
% 498.56/64.16 # Success case prop preproc time : 0.000
% 498.56/64.16 # Success case prop encoding time : 0.000
% 498.56/64.16 # Success case prop solver time : 0.000
% 498.56/64.16 # Current number of processed clauses : 8178
% 498.56/64.16 # Positive orientable unit clauses : 97
% 498.56/64.16 # Positive unorientable unit clauses: 1
% 498.56/64.16 # Negative unit clauses : 40
% 498.56/64.16 # Non-unit-clauses : 8040
% 498.56/64.16 # Current number of unprocessed clauses: 1296661
% 498.56/64.16 # ...number of literals in the above : 16172749
% 498.56/64.16 # Current number of archived formulas : 0
% 498.56/64.16 # Current number of archived clauses : 1119
% 498.56/64.16 # Clause-clause subsumption calls (NU) : 17835268
% 498.56/64.16 # Rec. Clause-clause subsumption calls : 489561
% 498.56/64.16 # Non-unit clause-clause subsumptions : 8500
% 498.56/64.16 # Unit Clause-clause subsumption calls : 69298
% 498.56/64.16 # Rewrite failures with RHS unbound : 0
% 498.56/64.16 # BW rewrite match attempts : 308
% 498.56/64.16 # BW rewrite match successes : 22
% 498.56/64.16 # Condensation attempts : 0
% 498.56/64.16 # Condensation successes : 0
% 498.56/64.16 # Termbank termtop insertions : 43317370
% 498.56/64.16
% 498.56/64.16 # -------------------------------------------------
% 498.56/64.16 # User time : 60.889 s
% 498.56/64.16 # System time : 1.115 s
% 498.56/64.16 # Total time : 62.004 s
% 498.56/64.16 # Maximum resident set size: 1848 pages
% 498.56/64.16
% 498.56/64.16 # -------------------------------------------------
% 498.56/64.16 # User time : 60.893 s
% 498.56/64.16 # System time : 1.117 s
% 498.56/64.16 # Total time : 62.010 s
% 498.56/64.16 # Maximum resident set size: 1704 pages
% 498.56/64.16 % E---3.1 exiting
% 498.56/64.16 % E---3.1 exiting
%------------------------------------------------------------------------------