TSTP Solution File: LAT287+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT287+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 18:08:19 EDT 2023
% Result : Theorem 374.27s 51.95s
% Output : CNFRefutation 374.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 203 ( 12 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 237 ( 89 ~; 78 |; 48 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-1 aty)
% Number of variables : 61 ( 1 sgn; 39 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',t16_lopclset) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( v1_xboole_0(X1)
& X1 != X2
& v1_xboole_0(X2) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',t8_boole) ).
fof(d5_xboole_0,axiom,
! [X1] :
( v1_xboole_0(X1)
<=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',d5_xboole_0) ).
fof(fc1_tops_1,axiom,
! [X1] :
( ( v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ( v1_xboole_0(k1_pre_topc(X1))
& v4_pre_topc(k1_pre_topc(X1),X1)
& v1_membered(k1_pre_topc(X1))
& v2_membered(k1_pre_topc(X1))
& v3_membered(k1_pre_topc(X1))
& v4_membered(k1_pre_topc(X1))
& v5_membered(k1_pre_topc(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',fc1_tops_1) ).
fof(t7_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',t7_lopclset) ).
fof(t13_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',t13_lopclset) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',d2_subset_1) ).
fof(redefinition_m2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',redefinition_m2_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',fc1_subset_1) ).
fof(dt_k1_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',dt_k1_lopclset) ).
fof(fc6_membered,axiom,
( v1_xboole_0(k1_xboole_0)
& v1_membered(k1_xboole_0)
& v2_membered(k1_xboole_0)
& v3_membered(k1_xboole_0)
& v4_membered(k1_xboole_0)
& v5_membered(k1_xboole_0) ),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',fc6_membered) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p',existence_m1_subset_1) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t16_lopclset])]) ).
fof(c_0_13,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_14,plain,
! [X683,X684] :
( ~ v1_xboole_0(X683)
| X683 = X684
| ~ v1_xboole_0(X684) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(c_0_15,plain,
! [X733] :
( ( ~ v1_xboole_0(X733)
| X733 = k1_xboole_0 )
& ( X733 != k1_xboole_0
| v1_xboole_0(X733) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_xboole_0])]) ).
fof(c_0_16,plain,
! [X35] :
( ( v1_xboole_0(k1_pre_topc(X35))
| ~ v2_pre_topc(X35)
| ~ l1_pre_topc(X35) )
& ( v4_pre_topc(k1_pre_topc(X35),X35)
| ~ v2_pre_topc(X35)
| ~ l1_pre_topc(X35) )
& ( v1_membered(k1_pre_topc(X35))
| ~ v2_pre_topc(X35)
| ~ l1_pre_topc(X35) )
& ( v2_membered(k1_pre_topc(X35))
| ~ v2_pre_topc(X35)
| ~ l1_pre_topc(X35) )
& ( v3_membered(k1_pre_topc(X35))
| ~ v2_pre_topc(X35)
| ~ l1_pre_topc(X35) )
& ( v4_membered(k1_pre_topc(X35))
| ~ v2_pre_topc(X35)
| ~ l1_pre_topc(X35) )
& ( v5_membered(k1_pre_topc(X35))
| ~ v2_pre_topc(X35)
| ~ l1_pre_topc(X35) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_tops_1])])]) ).
fof(c_0_17,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t7_lopclset]) ).
fof(c_0_18,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
inference(fof_simplification,[status(thm)],[t13_lopclset]) ).
cnf(c_0_19,negated_conjecture,
~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ v1_xboole_0(X1)
| ~ v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( X1 = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( v1_xboole_0(k1_pre_topc(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_24,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_subset_1]) ).
fof(c_0_25,plain,
! [X48] :
( v3_struct_0(X48)
| ~ v2_pre_topc(X48)
| ~ l1_pre_topc(X48)
| m2_subset_1(k1_pre_topc(X48),k1_zfmisc_1(u1_struct_0(X48)),k1_lopclset(X48)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
fof(c_0_26,plain,
! [X25] :
( v3_struct_0(X25)
| ~ v2_pre_topc(X25)
| ~ l1_pre_topc(X25)
| u1_struct_0(k6_lopclset(X25)) = k1_lopclset(X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).
fof(c_0_27,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_28,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
inference(fof_simplification,[status(thm)],[dt_k1_lopclset]) ).
cnf(c_0_29,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(k6_lopclset(esk1_0)))
| ~ v1_xboole_0(k1_pre_topc(esk1_0))
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_30,plain,
( k1_pre_topc(X1) = k1_xboole_0
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_32,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_34,plain,
! [X16] : m1_subset_1(esk2_1(X16),X16),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_35,plain,
! [X690,X691] :
( ( ~ m1_subset_1(X691,X690)
| r2_hidden(X691,X690)
| v1_xboole_0(X690) )
& ( ~ r2_hidden(X691,X690)
| m1_subset_1(X691,X690)
| v1_xboole_0(X690) )
& ( ~ m1_subset_1(X691,X690)
| v1_xboole_0(X691)
| ~ v1_xboole_0(X690) )
& ( ~ v1_xboole_0(X691)
| m1_subset_1(X691,X690)
| ~ v1_xboole_0(X690) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
fof(c_0_36,plain,
! [X1149,X1150,X1151] :
( ( ~ m2_subset_1(X1151,X1149,X1150)
| m1_subset_1(X1151,X1150)
| v1_xboole_0(X1149)
| v1_xboole_0(X1150)
| ~ m1_subset_1(X1150,k1_zfmisc_1(X1149)) )
& ( ~ m1_subset_1(X1151,X1150)
| m2_subset_1(X1151,X1149,X1150)
| v1_xboole_0(X1149)
| v1_xboole_0(X1150)
| ~ m1_subset_1(X1150,k1_zfmisc_1(X1149)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
cnf(c_0_37,plain,
( v3_struct_0(X1)
| m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( v3_struct_0(X1)
| u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_39,plain,
! [X685] : ~ v1_xboole_0(k1_zfmisc_1(X685)),
inference(variable_rename,[status(thm)],[c_0_27]) ).
fof(c_0_40,plain,
! [X430] :
( v3_struct_0(X430)
| ~ l1_pre_topc(X430)
| m1_subset_1(k1_lopclset(X430),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X430)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
cnf(c_0_41,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(k6_lopclset(esk1_0)))
| ~ v1_xboole_0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_42,plain,
m1_subset_1(esk2_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( v1_xboole_0(X1)
| ~ m1_subset_1(X1,X2)
| ~ v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
( m1_subset_1(X1,X3)
| v1_xboole_0(X2)
| v1_xboole_0(X3)
| ~ m2_subset_1(X1,X2,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
( v3_struct_0(X1)
| m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),u1_struct_0(k6_lopclset(X1)))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
( v3_struct_0(X1)
| m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,negated_conjecture,
~ v1_xboole_0(esk2_1(u1_struct_0(k6_lopclset(esk1_0)))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
( v1_xboole_0(esk2_1(X1))
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_50,plain,
( m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1)))
| v1_xboole_0(u1_struct_0(k6_lopclset(X1)))
| v3_struct_0(X1)
| ~ m1_subset_1(u1_struct_0(k6_lopclset(X1)),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
( v3_struct_0(X1)
| m1_subset_1(u1_struct_0(k6_lopclset(X1)),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_38]) ).
cnf(c_0_52,negated_conjecture,
~ v1_xboole_0(u1_struct_0(k6_lopclset(esk1_0))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_54,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_50,c_0_51,c_0_52,c_0_19,c_0_53,c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.16/1.29 % Problem : LAT287+3 : TPTP v8.1.2. Released v3.4.0.
% 1.29/1.30 % Command : run_E %s %d THM
% 1.29/1.50 % Computer : n006.cluster.edu
% 1.29/1.50 % Model : x86_64 x86_64
% 1.29/1.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.29/1.50 % Memory : 8042.1875MB
% 1.29/1.50 % OS : Linux 3.10.0-693.el7.x86_64
% 1.29/1.50 % CPULimit : 2400
% 1.29/1.50 % WCLimit : 300
% 1.29/1.50 % DateTime : Mon Oct 2 10:03:12 EDT 2023
% 1.29/1.50 % CPUTime :
% 3.92/4.20 Running first-order theorem proving
% 3.92/4.20 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.f1SqL9Jx3i/E---3.1_19292.p
% 374.27/51.95 # Version: 3.1pre001
% 374.27/51.95 # Preprocessing class: FMLLSMLLSSSNFFN.
% 374.27/51.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 374.27/51.95 # Starting new_bool_3 with 900s (3) cores
% 374.27/51.95 # Starting new_bool_1 with 900s (3) cores
% 374.27/51.95 # Starting sh5l with 300s (1) cores
% 374.27/51.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 374.27/51.95 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 19390 completed with status 0
% 374.27/51.95 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 374.27/51.95 # Preprocessing class: FMLLSMLLSSSNFFN.
% 374.27/51.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 374.27/51.95 # Starting new_bool_3 with 900s (3) cores
% 374.27/51.95 # Starting new_bool_1 with 900s (3) cores
% 374.27/51.95 # Starting sh5l with 300s (1) cores
% 374.27/51.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 374.27/51.95 # SinE strategy is gf120_gu_R02_F100_L20000
% 374.27/51.95 # Search class: FGHSM-FSLM31-MFFFFFNN
% 374.27/51.95 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 374.27/51.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 374.27/51.95 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 19391 completed with status 0
% 374.27/51.95 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 374.27/51.95 # Preprocessing class: FMLLSMLLSSSNFFN.
% 374.27/51.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 374.27/51.95 # Starting new_bool_3 with 900s (3) cores
% 374.27/51.95 # Starting new_bool_1 with 900s (3) cores
% 374.27/51.95 # Starting sh5l with 300s (1) cores
% 374.27/51.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 374.27/51.95 # SinE strategy is gf120_gu_R02_F100_L20000
% 374.27/51.95 # Search class: FGHSM-FSLM31-MFFFFFNN
% 374.27/51.95 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 374.27/51.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 374.27/51.95 # Preprocessing time : 0.023 s
% 374.27/51.95 # Presaturation interreduction done
% 374.27/51.95 # SatCheck found unsatisfiable ground set
% 374.27/51.95
% 374.27/51.95 # Proof found!
% 374.27/51.95 # SZS status Theorem
% 374.27/51.95 # SZS output start CNFRefutation
% See solution above
% 374.27/51.95 # Parsed axioms : 12372
% 374.27/51.95 # Removed by relevancy pruning/SinE : 11918
% 374.27/51.95 # Initial clauses : 946
% 374.27/51.95 # Removed in clause preprocessing : 15
% 374.27/51.95 # Initial clauses in saturation : 931
% 374.27/51.95 # Processed clauses : 93428
% 374.27/51.95 # ...of these trivial : 2524
% 374.27/51.95 # ...subsumed : 75904
% 374.27/51.95 # ...remaining for further processing : 15000
% 374.27/51.95 # Other redundant clauses eliminated : 2112
% 374.27/51.95 # Clauses deleted for lack of memory : 0
% 374.27/51.95 # Backward-subsumed : 429
% 374.27/51.95 # Backward-rewritten : 407
% 374.27/51.95 # Generated clauses : 1399895
% 374.27/51.95 # ...of the previous two non-redundant : 1154852
% 374.27/51.95 # ...aggressively subsumed : 0
% 374.27/51.95 # Contextual simplify-reflections : 247
% 374.27/51.95 # Paramodulations : 1397721
% 374.27/51.95 # Factorizations : 21
% 374.27/51.95 # NegExts : 0
% 374.27/51.95 # Equation resolutions : 2119
% 374.27/51.95 # Total rewrite steps : 1887557
% 374.27/51.95 # Propositional unsat checks : 3
% 374.27/51.95 # Propositional check models : 0
% 374.27/51.95 # Propositional check unsatisfiable : 1
% 374.27/51.95 # Propositional clauses : 1073664
% 374.27/51.95 # Propositional clauses after purity: 126948
% 374.27/51.95 # Propositional unsat core size : 7
% 374.27/51.95 # Propositional preprocessing time : 0.000
% 374.27/51.95 # Propositional encoding time : 8.533
% 374.27/51.95 # Propositional solver time : 1.865
% 374.27/51.95 # Success case prop preproc time : 0.000
% 374.27/51.95 # Success case prop encoding time : 4.559
% 374.27/51.95 # Success case prop solver time : 0.251
% 374.27/51.95 # Current number of processed clauses : 13235
% 374.27/51.95 # Positive orientable unit clauses : 2799
% 374.27/51.95 # Positive unorientable unit clauses: 21
% 374.27/51.95 # Negative unit clauses : 2235
% 374.27/51.95 # Non-unit-clauses : 8180
% 374.27/51.95 # Current number of unprocessed clauses: 1060429
% 374.27/51.95 # ...number of literals in the above : 2553284
% 374.27/51.95 # Current number of archived formulas : 0
% 374.27/51.95 # Current number of archived clauses : 1728
% 374.27/51.95 # Clause-clause subsumption calls (NU) : 12543843
% 374.27/51.95 # Rec. Clause-clause subsumption calls : 6516467
% 374.27/51.95 # Non-unit clause-clause subsumptions : 21571
% 374.27/51.95 # Unit Clause-clause subsumption calls : 2458919
% 374.27/51.95 # Rewrite failures with RHS unbound : 0
% 374.27/51.95 # BW rewrite match attempts : 6809
% 374.27/51.95 # BW rewrite match successes : 1012
% 374.27/51.95 # Condensation attempts : 0
% 374.27/51.95 # Condensation successes : 0
% 374.27/51.95 # Termbank termtop insertions : 53989481
% 374.27/51.95
% 374.27/51.95 # -------------------------------------------------
% 374.27/51.95 # User time : 45.296 s
% 374.27/51.95 # System time : 1.261 s
% 374.27/51.95 # Total time : 46.557 s
% 374.27/51.95 # Maximum resident set size: 23672 pages
% 374.27/51.95
% 374.27/51.95 # -------------------------------------------------
% 374.27/51.95 # User time : 45.682 s
% 374.27/51.95 # System time : 1.279 s
% 374.27/51.95 # Total time : 46.961 s
% 374.27/51.95 # Maximum resident set size: 18172 pages
% 374.27/51.95 % E---3.1 exiting
% 374.27/51.95 % E---3.1 exiting
%------------------------------------------------------------------------------