TSTP Solution File: SEU270+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU270+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:14 EDT 2023
% Result : Theorem 1541.88s 226.29s
% Output : CNFRefutation 1541.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 51 ( 10 unt; 0 def)
% Number of atoms : 209 ( 22 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 262 ( 104 ~; 115 |; 26 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 85 ( 1 sgn; 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d6_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_connected_in(X1,X2)
<=> ! [X3,X4] :
~ ( in(X3,X2)
& in(X4,X2)
& X3 != X4
& ~ in(ordered_pair(X3,X4),X1)
& ~ in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',d6_relat_2) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',dt_k1_wellord2) ).
fof(d1_wellord2,axiom,
! [X1,X2] :
( relation(X2)
=> ( X2 = inclusion_relation(X1)
<=> ( relation_field(X2) = X1
& ! [X3,X4] :
( ( in(X3,X1)
& in(X4,X1) )
=> ( in(ordered_pair(X3,X4),X2)
<=> subset(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',d1_wellord2) ).
fof(t23_ordinal1,axiom,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',t23_ordinal1) ).
fof(t4_wellord2,conjecture,
! [X1] :
( ordinal(X1)
=> connected(inclusion_relation(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',t4_wellord2) ).
fof(d14_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> is_connected_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',d14_relat_2) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',connectedness_r1_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p',redefinition_r1_ordinal1) ).
fof(c_0_8,plain,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_connected_in(X1,X2)
<=> ! [X3,X4] :
~ ( in(X3,X2)
& in(X4,X2)
& X3 != X4
& ~ in(ordered_pair(X3,X4),X1)
& ~ in(ordered_pair(X4,X3),X1) ) ) ),
inference(fof_simplification,[status(thm)],[d6_relat_2]) ).
fof(c_0_9,plain,
! [X28,X29,X30,X31,X32] :
( ( ~ is_connected_in(X28,X29)
| ~ in(X30,X29)
| ~ in(X31,X29)
| X30 = X31
| in(ordered_pair(X30,X31),X28)
| in(ordered_pair(X31,X30),X28)
| ~ relation(X28) )
& ( in(esk7_2(X28,X32),X32)
| is_connected_in(X28,X32)
| ~ relation(X28) )
& ( in(esk8_2(X28,X32),X32)
| is_connected_in(X28,X32)
| ~ relation(X28) )
& ( esk7_2(X28,X32) != esk8_2(X28,X32)
| is_connected_in(X28,X32)
| ~ relation(X28) )
& ( ~ in(ordered_pair(esk7_2(X28,X32),esk8_2(X28,X32)),X28)
| is_connected_in(X28,X32)
| ~ relation(X28) )
& ( ~ in(ordered_pair(esk8_2(X28,X32),esk7_2(X28,X32)),X28)
| is_connected_in(X28,X32)
| ~ relation(X28) ) ),
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)],[c_0_8])])])])])]) ).
fof(c_0_10,plain,
! [X13] : relation(inclusion_relation(X13)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
fof(c_0_11,plain,
! [X7,X8,X9,X10] :
( ( relation_field(X8) = X7
| X8 != inclusion_relation(X7)
| ~ relation(X8) )
& ( ~ in(ordered_pair(X9,X10),X8)
| subset(X9,X10)
| ~ in(X9,X7)
| ~ in(X10,X7)
| X8 != inclusion_relation(X7)
| ~ relation(X8) )
& ( ~ subset(X9,X10)
| in(ordered_pair(X9,X10),X8)
| ~ in(X9,X7)
| ~ in(X10,X7)
| X8 != inclusion_relation(X7)
| ~ relation(X8) )
& ( in(esk2_2(X7,X8),X7)
| relation_field(X8) != X7
| X8 = inclusion_relation(X7)
| ~ relation(X8) )
& ( in(esk3_2(X7,X8),X7)
| relation_field(X8) != X7
| X8 = inclusion_relation(X7)
| ~ relation(X8) )
& ( ~ in(ordered_pair(esk2_2(X7,X8),esk3_2(X7,X8)),X8)
| ~ subset(esk2_2(X7,X8),esk3_2(X7,X8))
| relation_field(X8) != X7
| X8 = inclusion_relation(X7)
| ~ relation(X8) )
& ( in(ordered_pair(esk2_2(X7,X8),esk3_2(X7,X8)),X8)
| subset(esk2_2(X7,X8),esk3_2(X7,X8))
| relation_field(X8) != X7
| X8 = inclusion_relation(X7)
| ~ relation(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_wellord2])])])])]) ).
fof(c_0_12,plain,
! [X26,X27] :
( ~ ordinal(X27)
| ~ in(X26,X27)
| ordinal(X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_ordinal1])]) ).
cnf(c_0_13,plain,
( in(esk7_2(X1,X2),X2)
| is_connected_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> connected(inclusion_relation(X1)) ),
inference(assume_negation,[status(cth)],[t4_wellord2]) ).
fof(c_0_16,plain,
! [X6] :
( ( ~ connected(X6)
| is_connected_in(X6,relation_field(X6))
| ~ relation(X6) )
& ( ~ is_connected_in(X6,relation_field(X6))
| connected(X6)
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_relat_2])])]) ).
cnf(c_0_17,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ordinal(X2)
| ~ ordinal(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( is_connected_in(inclusion_relation(X1),X2)
| in(esk7_2(inclusion_relation(X1),X2),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_20,negated_conjecture,
( ordinal(esk1_0)
& ~ connected(inclusion_relation(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_21,plain,
( in(esk8_2(X1,X2),X2)
| is_connected_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( connected(X1)
| ~ is_connected_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
relation_field(inclusion_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_14])]) ).
cnf(c_0_24,plain,
( is_connected_in(inclusion_relation(X1),X2)
| ordinal(esk7_2(inclusion_relation(X1),X2))
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( is_connected_in(inclusion_relation(X1),X2)
| in(esk8_2(inclusion_relation(X1),X2),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_27,plain,
( in(ordered_pair(X1,X2),X3)
| ~ subset(X1,X2)
| ~ in(X1,X4)
| ~ in(X2,X4)
| X3 != inclusion_relation(X4)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_28,plain,
! [X17,X18] :
( ~ ordinal(X17)
| ~ ordinal(X18)
| ordinal_subset(X17,X18)
| ordinal_subset(X18,X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])]) ).
cnf(c_0_29,plain,
( connected(inclusion_relation(X1))
| ~ is_connected_in(inclusion_relation(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14])]) ).
cnf(c_0_30,negated_conjecture,
( is_connected_in(inclusion_relation(X1),esk1_0)
| ordinal(esk7_2(inclusion_relation(X1),esk1_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
~ connected(inclusion_relation(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
( is_connected_in(inclusion_relation(X1),X2)
| ordinal(esk8_2(inclusion_relation(X1),X2))
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_33,plain,
( is_connected_in(X1,X2)
| ~ in(ordered_pair(esk7_2(X1,X2),esk8_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,plain,
( in(ordered_pair(X1,X2),inclusion_relation(X3))
| ~ subset(X1,X2)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_14])]) ).
fof(c_0_35,plain,
! [X22,X23] :
( ( ~ ordinal_subset(X22,X23)
| subset(X22,X23)
| ~ ordinal(X22)
| ~ ordinal(X23) )
& ( ~ subset(X22,X23)
| ordinal_subset(X22,X23)
| ~ ordinal(X22)
| ~ ordinal(X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_36,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,negated_conjecture,
ordinal(esk7_2(inclusion_relation(esk1_0),esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( is_connected_in(inclusion_relation(X1),esk1_0)
| ordinal(esk8_2(inclusion_relation(X1),esk1_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_39,plain,
( is_connected_in(X1,X2)
| ~ in(ordered_pair(esk8_2(X1,X2),esk7_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_40,plain,
( is_connected_in(inclusion_relation(X1),X2)
| ~ subset(esk7_2(inclusion_relation(X1),X2),esk8_2(inclusion_relation(X1),X2))
| ~ in(esk8_2(inclusion_relation(X1),X2),X1)
| ~ in(esk7_2(inclusion_relation(X1),X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_14])]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( ordinal_subset(X1,esk7_2(inclusion_relation(esk1_0),esk1_0))
| ordinal_subset(esk7_2(inclusion_relation(esk1_0),esk1_0),X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
ordinal(esk8_2(inclusion_relation(esk1_0),esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_38]),c_0_31]) ).
cnf(c_0_44,plain,
( is_connected_in(inclusion_relation(X1),X2)
| ~ subset(esk8_2(inclusion_relation(X1),X2),esk7_2(inclusion_relation(X1),X2))
| ~ in(esk7_2(inclusion_relation(X1),X2),X1)
| ~ in(esk8_2(inclusion_relation(X1),X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_34]),c_0_14])]) ).
cnf(c_0_45,plain,
( is_connected_in(inclusion_relation(X1),X2)
| ~ ordinal_subset(esk7_2(inclusion_relation(X1),X2),esk8_2(inclusion_relation(X1),X2))
| ~ ordinal(esk8_2(inclusion_relation(X1),X2))
| ~ ordinal(esk7_2(inclusion_relation(X1),X2))
| ~ in(esk8_2(inclusion_relation(X1),X2),X1)
| ~ in(esk7_2(inclusion_relation(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( ordinal_subset(esk7_2(inclusion_relation(esk1_0),esk1_0),esk8_2(inclusion_relation(esk1_0),esk1_0))
| ordinal_subset(esk8_2(inclusion_relation(esk1_0),esk1_0),esk7_2(inclusion_relation(esk1_0),esk1_0)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
( is_connected_in(inclusion_relation(X1),X2)
| ~ ordinal_subset(esk8_2(inclusion_relation(X1),X2),esk7_2(inclusion_relation(X1),X2))
| ~ ordinal(esk7_2(inclusion_relation(X1),X2))
| ~ ordinal(esk8_2(inclusion_relation(X1),X2))
| ~ in(esk7_2(inclusion_relation(X1),X2),X1)
| ~ in(esk8_2(inclusion_relation(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( is_connected_in(inclusion_relation(esk1_0),esk1_0)
| ordinal_subset(esk8_2(inclusion_relation(esk1_0),esk1_0),esk7_2(inclusion_relation(esk1_0),esk1_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_43]),c_0_37])]),c_0_19]),c_0_26]) ).
cnf(c_0_49,negated_conjecture,
is_connected_in(inclusion_relation(esk1_0),esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_37]),c_0_43])]),c_0_26]),c_0_19]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_49]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU270+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 09:18:29 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.pi8BPNFZDi/E---3.1_7203.p
% 1541.88/226.29 # Version: 3.1pre001
% 1541.88/226.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1541.88/226.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1541.88/226.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1541.88/226.29 # Starting new_bool_3 with 300s (1) cores
% 1541.88/226.29 # Starting new_bool_1 with 300s (1) cores
% 1541.88/226.29 # Starting sh5l with 300s (1) cores
% 1541.88/226.29 # sh5l with pid 7285 completed with status 0
% 1541.88/226.29 # Result found by sh5l
% 1541.88/226.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1541.88/226.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1541.88/226.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1541.88/226.29 # Starting new_bool_3 with 300s (1) cores
% 1541.88/226.29 # Starting new_bool_1 with 300s (1) cores
% 1541.88/226.29 # Starting sh5l with 300s (1) cores
% 1541.88/226.29 # SinE strategy is gf500_gu_R04_F100_L20000
% 1541.88/226.29 # Search class: FGHSM-FFMM21-SFFFFFNN
% 1541.88/226.29 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1541.88/226.29 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 1541.88/226.29 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 7293 completed with status 7
% 1541.88/226.29 # Starting sh5l with 31s (1) cores
% 1541.88/226.29 # sh5l with pid 14316 completed with status 7
% 1541.88/226.29 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 28s (1) cores
% 1541.88/226.29 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 14651 completed with status 7
% 1541.88/226.29 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 28s (1) cores
% 1541.88/226.29 # G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with pid 14657 completed with status 0
% 1541.88/226.29 # Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN
% 1541.88/226.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1541.88/226.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1541.88/226.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1541.88/226.29 # Starting new_bool_3 with 300s (1) cores
% 1541.88/226.29 # Starting new_bool_1 with 300s (1) cores
% 1541.88/226.29 # Starting sh5l with 300s (1) cores
% 1541.88/226.29 # SinE strategy is gf500_gu_R04_F100_L20000
% 1541.88/226.29 # Search class: FGHSM-FFMM21-SFFFFFNN
% 1541.88/226.29 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1541.88/226.29 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 1541.88/226.29 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 7293 completed with status 7
% 1541.88/226.29 # Starting sh5l with 31s (1) cores
% 1541.88/226.29 # sh5l with pid 14316 completed with status 7
% 1541.88/226.29 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 28s (1) cores
% 1541.88/226.29 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 14651 completed with status 7
% 1541.88/226.29 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 28s (1) cores
% 1541.88/226.29 # Preprocessing time : 0.002 s
% 1541.88/226.29 # Presaturation interreduction done
% 1541.88/226.29
% 1541.88/226.29 # Proof found!
% 1541.88/226.29 # SZS status Theorem
% 1541.88/226.29 # SZS output start CNFRefutation
% See solution above
% 1541.88/226.29 # Parsed axioms : 55
% 1541.88/226.29 # Removed by relevancy pruning/SinE : 10
% 1541.88/226.29 # Initial clauses : 90
% 1541.88/226.29 # Removed in clause preprocessing : 2
% 1541.88/226.29 # Initial clauses in saturation : 88
% 1541.88/226.29 # Processed clauses : 13567
% 1541.88/226.29 # ...of these trivial : 27
% 1541.88/226.29 # ...subsumed : 10194
% 1541.88/226.29 # ...remaining for further processing : 3346
% 1541.88/226.29 # Other redundant clauses eliminated : 7
% 1541.88/226.29 # Clauses deleted for lack of memory : 0
% 1541.88/226.29 # Backward-subsumed : 223
% 1541.88/226.29 # Backward-rewritten : 55
% 1541.88/226.29 # Generated clauses : 90394
% 1541.88/226.29 # ...of the previous two non-redundant : 84816
% 1541.88/226.29 # ...aggressively subsumed : 0
% 1541.88/226.29 # Contextual simplify-reflections : 110
% 1541.88/226.29 # Paramodulations : 90387
% 1541.88/226.29 # Factorizations : 0
% 1541.88/226.29 # NegExts : 0
% 1541.88/226.29 # Equation resolutions : 7
% 1541.88/226.29 # Total rewrite steps : 14929
% 1541.88/226.29 # Propositional unsat checks : 0
% 1541.88/226.29 # Propositional check models : 0
% 1541.88/226.29 # Propositional check unsatisfiable : 0
% 1541.88/226.29 # Propositional clauses : 0
% 1541.88/226.29 # Propositional clauses after purity: 0
% 1541.88/226.29 # Propositional unsat core size : 0
% 1541.88/226.29 # Propositional preprocessing time : 0.000
% 1541.88/226.29 # Propositional encoding time : 0.000
% 1541.88/226.29 # Propositional solver time : 0.000
% 1541.88/226.29 # Success case prop preproc time : 0.000
% 1541.88/226.29 # Success case prop encoding time : 0.000
% 1541.88/226.29 # Success case prop solver time : 0.000
% 1541.88/226.29 # Current number of processed clauses : 2974
% 1541.88/226.29 # Positive orientable unit clauses : 86
% 1541.88/226.29 # Positive unorientable unit clauses: 2
% 1541.88/226.29 # Negative unit clauses : 5
% 1541.88/226.29 # Non-unit-clauses : 2881
% 1541.88/226.29 # Current number of unprocessed clauses: 70302
% 1541.88/226.29 # ...number of literals in the above : 268563
% 1541.88/226.29 # Current number of archived formulas : 0
% 1541.88/226.29 # Current number of archived clauses : 365
% 1541.88/226.29 # Clause-clause subsumption calls (NU) : 2326550
% 1541.88/226.29 # Rec. Clause-clause subsumption calls : 1364181
% 1541.88/226.29 # Non-unit clause-clause subsumptions : 9137
% 1541.88/226.29 # Unit Clause-clause subsumption calls : 4230
% 1541.88/226.29 # Rewrite failures with RHS unbound : 0
% 1541.88/226.29 # BW rewrite match attempts : 83
% 1541.88/226.29 # BW rewrite match successes : 31
% 1541.88/226.29 # Condensation attempts : 0
% 1541.88/226.29 # Condensation successes : 0
% 1541.88/226.29 # Termbank termtop insertions : 1620507
% 1541.88/226.29
% 1541.88/226.29 # -------------------------------------------------
% 1541.88/226.29 # User time : 221.645 s
% 1541.88/226.29 # System time : 2.421 s
% 1541.88/226.29 # Total time : 224.066 s
% 1541.88/226.29 # Maximum resident set size: 2012 pages
% 1541.88/226.29
% 1541.88/226.29 # -------------------------------------------------
% 1541.88/226.29 # User time : 221.647 s
% 1541.88/226.29 # System time : 2.430 s
% 1541.88/226.29 # Total time : 224.077 s
% 1541.88/226.29 # Maximum resident set size: 1720 pages
% 1541.88/226.29 % E---3.1 exiting
%------------------------------------------------------------------------------