TSTP Solution File: SEU318+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU318+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:58 EDT 2023
% Result : Theorem 1743.42s 220.88s
% Output : CNFRefutation 1743.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 8 unt; 0 def)
% Number of atoms : 294 ( 22 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 395 ( 158 ~; 173 |; 34 &)
% ( 5 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 118 ( 1 sgn; 50 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',d3_tarski) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',t3_subset) ).
fof(t44_pre_topc,axiom,
! [X1] :
( ( topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ( ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( in(X3,X2)
=> closed_subset(X3,X1) ) )
=> closed_subset(meet_of_subsets(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',t44_pre_topc) ).
fof(t46_pre_topc,axiom,
! [X1] :
( ( topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ? [X3] :
( element(X3,powerset(powerset(the_carrier(X1))))
& ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> ( closed_subset(X4,X1)
& subset(X2,X4) ) ) )
& topstr_closure(X1,X2) = meet_of_subsets(the_carrier(X1),X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',t46_pre_topc) ).
fof(dt_k6_pre_topc,axiom,
! [X1,X2] :
( ( top_str(X1)
& element(X2,powerset(the_carrier(X1))) )
=> element(topstr_closure(X1,X2),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',dt_k6_pre_topc) ).
fof(t45_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( in(X3,the_carrier(X1))
=> ( in(X3,topstr_closure(X1,X2))
<=> ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( ( closed_subset(X4,X1)
& subset(X2,X4) )
=> in(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',t45_pre_topc) ).
fof(t52_pre_topc,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( ( closed_subset(X2,X1)
=> topstr_closure(X1,X2) = X2 )
& ( ( topological_space(X1)
& topstr_closure(X1,X2) = X2 )
=> closed_subset(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',t52_pre_topc) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',d10_xboole_0) ).
fof(t48_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',t48_pre_topc) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.dFqWnfKFbn/E---3.1_20754.p',reflexivity_r1_tarski) ).
fof(c_0_10,plain,
! [X32,X33,X34,X35,X36] :
( ( ~ subset(X32,X33)
| ~ in(X34,X32)
| in(X34,X33) )
& ( in(esk9_2(X35,X36),X35)
| subset(X35,X36) )
& ( ~ in(esk9_2(X35,X36),X36)
| subset(X35,X36) ) ),
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_11,plain,
! [X53,X54] :
( ( ~ element(X53,powerset(X54))
| subset(X53,X54) )
& ( ~ subset(X53,X54)
| element(X53,powerset(X54)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_12,plain,
! [X9,X10] :
( ( element(esk4_2(X9,X10),powerset(the_carrier(X9)))
| closed_subset(meet_of_subsets(the_carrier(X9),X10),X9)
| ~ element(X10,powerset(powerset(the_carrier(X9))))
| ~ topological_space(X9)
| ~ top_str(X9) )
& ( in(esk4_2(X9,X10),X10)
| closed_subset(meet_of_subsets(the_carrier(X9),X10),X9)
| ~ element(X10,powerset(powerset(the_carrier(X9))))
| ~ topological_space(X9)
| ~ top_str(X9) )
& ( ~ closed_subset(esk4_2(X9,X10),X9)
| closed_subset(meet_of_subsets(the_carrier(X9),X10),X9)
| ~ element(X10,powerset(powerset(the_carrier(X9))))
| ~ topological_space(X9)
| ~ top_str(X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t44_pre_topc])])])])]) ).
fof(c_0_13,plain,
! [X17,X18,X20] :
( ( element(esk6_2(X17,X18),powerset(powerset(the_carrier(X17))))
| ~ element(X18,powerset(the_carrier(X17)))
| ~ topological_space(X17)
| ~ top_str(X17) )
& ( closed_subset(X20,X17)
| ~ in(X20,esk6_2(X17,X18))
| ~ element(X20,powerset(the_carrier(X17)))
| ~ element(X18,powerset(the_carrier(X17)))
| ~ topological_space(X17)
| ~ top_str(X17) )
& ( subset(X18,X20)
| ~ in(X20,esk6_2(X17,X18))
| ~ element(X20,powerset(the_carrier(X17)))
| ~ element(X18,powerset(the_carrier(X17)))
| ~ topological_space(X17)
| ~ top_str(X17) )
& ( ~ closed_subset(X20,X17)
| ~ subset(X18,X20)
| in(X20,esk6_2(X17,X18))
| ~ element(X20,powerset(the_carrier(X17)))
| ~ element(X18,powerset(the_carrier(X17)))
| ~ topological_space(X17)
| ~ top_str(X17) )
& ( topstr_closure(X17,X18) = meet_of_subsets(the_carrier(X17),esk6_2(X17,X18))
| ~ element(X18,powerset(the_carrier(X17)))
| ~ topological_space(X17)
| ~ top_str(X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t46_pre_topc])])])])]) ).
cnf(c_0_14,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X21,X22] :
( ~ top_str(X21)
| ~ element(X22,powerset(the_carrier(X21)))
| element(topstr_closure(X21,X22),powerset(the_carrier(X21))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])]) ).
cnf(c_0_17,plain,
( in(esk4_2(X1,X2),X2)
| closed_subset(meet_of_subsets(the_carrier(X1),X2),X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( element(esk6_2(X1,X2),powerset(powerset(the_carrier(X1))))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X12,X13,X14,X15] :
( ( ~ in(X14,topstr_closure(X12,X13))
| ~ element(X15,powerset(the_carrier(X12)))
| ~ closed_subset(X15,X12)
| ~ subset(X13,X15)
| in(X14,X15)
| ~ in(X14,the_carrier(X12))
| ~ element(X13,powerset(the_carrier(X12)))
| ~ top_str(X12) )
& ( element(esk5_3(X12,X13,X14),powerset(the_carrier(X12)))
| in(X14,topstr_closure(X12,X13))
| ~ in(X14,the_carrier(X12))
| ~ element(X13,powerset(the_carrier(X12)))
| ~ top_str(X12) )
& ( closed_subset(esk5_3(X12,X13,X14),X12)
| in(X14,topstr_closure(X12,X13))
| ~ in(X14,the_carrier(X12))
| ~ element(X13,powerset(the_carrier(X12)))
| ~ top_str(X12) )
& ( subset(X13,esk5_3(X12,X13,X14))
| in(X14,topstr_closure(X12,X13))
| ~ in(X14,the_carrier(X12))
| ~ element(X13,powerset(the_carrier(X12)))
| ~ top_str(X12) )
& ( ~ in(X14,esk5_3(X12,X13,X14))
| in(X14,topstr_closure(X12,X13))
| ~ in(X14,the_carrier(X12))
| ~ element(X13,powerset(the_carrier(X12)))
| ~ top_str(X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t45_pre_topc])])])])]) ).
cnf(c_0_20,plain,
( in(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( element(topstr_closure(X1,X2),powerset(the_carrier(X1)))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( closed_subset(X1,X2)
| ~ in(X1,esk6_2(X2,X3))
| ~ element(X1,powerset(the_carrier(X2)))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ topological_space(X2)
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( closed_subset(meet_of_subsets(the_carrier(X1),esk6_2(X1,X2)),X1)
| in(esk4_2(X1,esk6_2(X1,X2)),esk6_2(X1,X2))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( element(esk4_2(X1,X2),powerset(the_carrier(X1)))
| closed_subset(meet_of_subsets(the_carrier(X1),X2),X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
( topstr_closure(X1,X2) = meet_of_subsets(the_carrier(X1),esk6_2(X1,X2))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
( closed_subset(meet_of_subsets(the_carrier(X1),X2),X1)
| ~ closed_subset(esk4_2(X1,X2),X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( ( closed_subset(X2,X1)
=> topstr_closure(X1,X2) = X2 )
& ( ( topological_space(X1)
& topstr_closure(X1,X2) = X2 )
=> closed_subset(X2,X1) ) ) ) ),
inference(assume_negation,[status(cth)],[t52_pre_topc]) ).
cnf(c_0_28,plain,
( in(X1,X4)
| ~ in(X1,topstr_closure(X2,X3))
| ~ element(X4,powerset(the_carrier(X2)))
| ~ closed_subset(X4,X2)
| ~ subset(X3,X4)
| ~ in(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( in(esk9_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( in(X1,the_carrier(X2))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,topstr_closure(X2,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,plain,
( closed_subset(meet_of_subsets(the_carrier(X1),esk6_2(X1,X2)),X1)
| closed_subset(esk4_2(X1,esk6_2(X1,X2)),X1)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(esk4_2(X1,esk6_2(X1,X2)),powerset(the_carrier(X1)))
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
( closed_subset(topstr_closure(X1,X2),X1)
| element(esk4_2(X1,esk6_2(X1,X2)),powerset(the_carrier(X1)))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18]) ).
cnf(c_0_33,plain,
( closed_subset(topstr_closure(X1,X2),X1)
| ~ closed_subset(esk4_2(X1,esk6_2(X1,X2)),X1)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_18]) ).
fof(c_0_34,negated_conjecture,
( top_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& ( topological_space(esk1_0)
| closed_subset(esk2_0,esk1_0) )
& ( topstr_closure(esk1_0,esk2_0) = esk2_0
| closed_subset(esk2_0,esk1_0) )
& ( ~ closed_subset(esk2_0,esk1_0)
| closed_subset(esk2_0,esk1_0) )
& ( topological_space(esk1_0)
| topstr_closure(esk1_0,esk2_0) != esk2_0 )
& ( topstr_closure(esk1_0,esk2_0) = esk2_0
| topstr_closure(esk1_0,esk2_0) != esk2_0 )
& ( ~ closed_subset(esk2_0,esk1_0)
| topstr_closure(esk1_0,esk2_0) != esk2_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
fof(c_0_35,plain,
! [X50,X51] :
( ( subset(X50,X51)
| X50 != X51 )
& ( subset(X51,X50)
| X50 != X51 )
& ( ~ subset(X50,X51)
| ~ subset(X51,X50)
| X50 = X51 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
fof(c_0_36,plain,
! [X23,X24] :
( ~ top_str(X23)
| ~ element(X24,powerset(the_carrier(X23)))
| subset(X24,topstr_closure(X23,X24)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t48_pre_topc])])]) ).
cnf(c_0_37,plain,
( subset(topstr_closure(X1,X2),X3)
| in(esk9_2(topstr_closure(X1,X2),X3),X4)
| ~ closed_subset(X4,X1)
| ~ top_str(X1)
| ~ subset(X2,X4)
| ~ element(X4,powerset(the_carrier(X1)))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(esk9_2(topstr_closure(X1,X2),X3),the_carrier(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,plain,
( subset(topstr_closure(X1,X2),X3)
| in(esk9_2(topstr_closure(X1,X2),X3),the_carrier(X1))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_39,plain,
( closed_subset(topstr_closure(X1,X2),X1)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_32]),c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( topstr_closure(esk1_0,esk2_0) = esk2_0
| closed_subset(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( topological_space(esk1_0)
| closed_subset(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
( subset(X2,topstr_closure(X1,X2))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
( subset(X1,X2)
| ~ in(esk9_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_47,plain,
( subset(topstr_closure(X1,X2),X3)
| in(esk9_2(topstr_closure(X1,X2),X3),X4)
| ~ closed_subset(X4,X1)
| ~ top_str(X1)
| ~ subset(X2,X4)
| ~ element(X4,powerset(the_carrier(X1)))
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_48,plain,
! [X52] : subset(X52,X52),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_49,negated_conjecture,
( ~ closed_subset(esk2_0,esk1_0)
| topstr_closure(esk1_0,esk2_0) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_50,negated_conjecture,
closed_subset(esk2_0,esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_51,plain,
( topstr_closure(X1,X2) = X2
| ~ top_str(X1)
| ~ subset(topstr_closure(X1,X2),X2)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( subset(topstr_closure(X1,X2),X3)
| ~ closed_subset(X3,X1)
| ~ top_str(X1)
| ~ subset(X2,X3)
| ~ element(X3,powerset(the_carrier(X1)))
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,negated_conjecture,
topstr_closure(esk1_0,esk2_0) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_55,plain,
( topstr_closure(X1,X2) = X2
| ~ closed_subset(X2,X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_50]),c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEU318+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n031.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 09:29:43 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.dFqWnfKFbn/E---3.1_20754.p
% 1743.42/220.88 # Version: 3.1pre001
% 1743.42/220.88 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1743.42/220.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1743.42/220.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1743.42/220.88 # Starting new_bool_3 with 300s (1) cores
% 1743.42/220.88 # Starting new_bool_1 with 300s (1) cores
% 1743.42/220.88 # Starting sh5l with 300s (1) cores
% 1743.42/220.88 # new_bool_1 with pid 20834 completed with status 0
% 1743.42/220.88 # Result found by new_bool_1
% 1743.42/220.88 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1743.42/220.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1743.42/220.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1743.42/220.88 # Starting new_bool_3 with 300s (1) cores
% 1743.42/220.88 # Starting new_bool_1 with 300s (1) cores
% 1743.42/220.88 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1743.42/220.88 # Search class: FGHSM-FFMS31-MFFFFFNN
% 1743.42/220.88 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1743.42/220.88 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 1743.42/220.88 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 20837 completed with status 7
% 1743.42/220.88 # Starting new_bool_1 with 31s (1) cores
% 1743.42/220.88 # new_bool_1 with pid 20906 completed with status 7
% 1743.42/220.88 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 28s (1) cores
% 1743.42/220.88 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 20915 completed with status 7
% 1743.42/220.88 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 28s (1) cores
% 1743.42/220.88 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 20922 completed with status 7
% 1743.42/220.88 # Starting G-E--_301_C18_F1_URBAN_S0Y with 28s (1) cores
% 1743.42/220.88 # G-E--_301_C18_F1_URBAN_S0Y with pid 20930 completed with status 0
% 1743.42/220.88 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 1743.42/220.88 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1743.42/220.88 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1743.42/220.88 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1743.42/220.88 # Starting new_bool_3 with 300s (1) cores
% 1743.42/220.88 # Starting new_bool_1 with 300s (1) cores
% 1743.42/220.88 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1743.42/220.88 # Search class: FGHSM-FFMS31-MFFFFFNN
% 1743.42/220.88 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1743.42/220.88 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 1743.42/220.88 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 20837 completed with status 7
% 1743.42/220.88 # Starting new_bool_1 with 31s (1) cores
% 1743.42/220.88 # new_bool_1 with pid 20906 completed with status 7
% 1743.42/220.88 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 28s (1) cores
% 1743.42/220.88 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 20915 completed with status 7
% 1743.42/220.88 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 28s (1) cores
% 1743.42/220.88 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 20922 completed with status 7
% 1743.42/220.88 # Starting G-E--_301_C18_F1_URBAN_S0Y with 28s (1) cores
% 1743.42/220.88 # Preprocessing time : 0.002 s
% 1743.42/220.88
% 1743.42/220.88 # Proof found!
% 1743.42/220.88 # SZS status Theorem
% 1743.42/220.88 # SZS output start CNFRefutation
% See solution above
% 1743.42/220.88 # Parsed axioms : 51
% 1743.42/220.88 # Removed by relevancy pruning/SinE : 27
% 1743.42/220.88 # Initial clauses : 49
% 1743.42/220.88 # Removed in clause preprocessing : 2
% 1743.42/220.88 # Initial clauses in saturation : 47
% 1743.42/220.88 # Processed clauses : 2162
% 1743.42/220.88 # ...of these trivial : 1
% 1743.42/220.88 # ...subsumed : 1185
% 1743.42/220.88 # ...remaining for further processing : 976
% 1743.42/220.88 # Other redundant clauses eliminated : 2
% 1743.42/220.88 # Clauses deleted for lack of memory : 0
% 1743.42/220.88 # Backward-subsumed : 96
% 1743.42/220.88 # Backward-rewritten : 56
% 1743.42/220.88 # Generated clauses : 15651
% 1743.42/220.88 # ...of the previous two non-redundant : 14313
% 1743.42/220.88 # ...aggressively subsumed : 0
% 1743.42/220.88 # Contextual simplify-reflections : 47
% 1743.42/220.88 # Paramodulations : 15649
% 1743.42/220.88 # Factorizations : 0
% 1743.42/220.88 # NegExts : 0
% 1743.42/220.88 # Equation resolutions : 2
% 1743.42/220.88 # Total rewrite steps : 2913
% 1743.42/220.88 # Propositional unsat checks : 0
% 1743.42/220.88 # Propositional check models : 0
% 1743.42/220.88 # Propositional check unsatisfiable : 0
% 1743.42/220.88 # Propositional clauses : 0
% 1743.42/220.88 # Propositional clauses after purity: 0
% 1743.42/220.88 # Propositional unsat core size : 0
% 1743.42/220.88 # Propositional preprocessing time : 0.000
% 1743.42/220.88 # Propositional encoding time : 0.000
% 1743.42/220.88 # Propositional solver time : 0.000
% 1743.42/220.88 # Success case prop preproc time : 0.000
% 1743.42/220.88 # Success case prop encoding time : 0.000
% 1743.42/220.88 # Success case prop solver time : 0.000
% 1743.42/220.88 # Current number of processed clauses : 822
% 1743.42/220.88 # Positive orientable unit clauses : 24
% 1743.42/220.88 # Positive unorientable unit clauses: 1
% 1743.42/220.88 # Negative unit clauses : 7
% 1743.42/220.88 # Non-unit-clauses : 790
% 1743.42/220.88 # Current number of unprocessed clauses: 12135
% 1743.42/220.88 # ...number of literals in the above : 65628
% 1743.42/220.88 # Current number of archived formulas : 0
% 1743.42/220.88 # Current number of archived clauses : 152
% 1743.42/220.88 # Clause-clause subsumption calls (NU) : 105024
% 1743.42/220.88 # Rec. Clause-clause subsumption calls : 21992
% 1743.42/220.88 # Non-unit clause-clause subsumptions : 1188
% 1743.42/220.88 # Unit Clause-clause subsumption calls : 359
% 1743.42/220.88 # Rewrite failures with RHS unbound : 24
% 1743.42/220.88 # BW rewrite match attempts : 51
% 1743.42/220.88 # BW rewrite match successes : 7
% 1743.42/220.88 # Condensation attempts : 0
% 1743.42/220.88 # Condensation successes : 0
% 1743.42/220.88 # Termbank termtop insertions : 365850
% 1743.42/220.88
% 1743.42/220.88 # -------------------------------------------------
% 1743.42/220.88 # User time : 214.706 s
% 1743.42/220.88 # System time : 2.964 s
% 1743.42/220.88 # Total time : 217.670 s
% 1743.42/220.88 # Maximum resident set size: 1928 pages
% 1743.42/220.88
% 1743.42/220.88 # -------------------------------------------------
% 1743.42/220.88 # User time : 214.709 s
% 1743.42/220.88 # System time : 2.973 s
% 1743.42/220.88 # Total time : 217.682 s
% 1743.42/220.88 # Maximum resident set size: 1724 pages
% 1743.42/220.88 % E---3.1 exiting
% 1743.49/220.88 % E---3.1 exiting
%------------------------------------------------------------------------------