TSTP Solution File: SEU311+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU311+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:35 EDT 2023
% Result : Theorem 1.36s 0.73s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 161 ( 61 ~; 60 |; 22 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 1 sgn; 28 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_xboole_0__e2_37_1_1__pre_topc__1,axiom,
! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(powerset(the_carrier(X1)))) )
=> ? [X3] :
! [X4] :
( in(X4,X3)
<=> ( in(X4,powerset(the_carrier(X1)))
& in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UPg7zLcwzc/E---3.1_5633.p',s1_xboole_0__e2_37_1_1__pre_topc__1) ).
fof(l71_subset_1,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.UPg7zLcwzc/E---3.1_5633.p',l71_subset_1) ).
fof(s3_subset_1__e2_37_1_1__pre_topc,conjecture,
! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(powerset(the_carrier(X1)))) )
=> ? [X3] :
( element(X3,powerset(powerset(the_carrier(X1))))
& ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UPg7zLcwzc/E---3.1_5633.p',s3_subset_1__e2_37_1_1__pre_topc) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UPg7zLcwzc/E---3.1_5633.p',d2_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox2/tmp/tmp.UPg7zLcwzc/E---3.1_5633.p',fc1_subset_1) ).
fof(c_0_5,plain,
! [X11,X12,X14,X15] :
( ( in(X14,powerset(the_carrier(X11)))
| ~ in(X14,esk4_2(X11,X12))
| ~ topological_space(X11)
| ~ top_str(X11)
| ~ element(X12,powerset(powerset(the_carrier(X11)))) )
& ( in(set_difference(cast_as_carrier_subset(X11),X14),X12)
| ~ in(X14,esk4_2(X11,X12))
| ~ topological_space(X11)
| ~ top_str(X11)
| ~ element(X12,powerset(powerset(the_carrier(X11)))) )
& ( ~ in(X15,powerset(the_carrier(X11)))
| ~ in(set_difference(cast_as_carrier_subset(X11),X15),X12)
| in(X15,esk4_2(X11,X12))
| ~ topological_space(X11)
| ~ top_str(X11)
| ~ element(X12,powerset(powerset(the_carrier(X11)))) ) ),
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)],[s1_xboole_0__e2_37_1_1__pre_topc__1])])])])])]) ).
fof(c_0_6,plain,
! [X18,X19] :
( ( in(esk5_2(X18,X19),X18)
| element(X18,powerset(X19)) )
& ( ~ in(esk5_2(X18,X19),X19)
| element(X18,powerset(X19)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(powerset(the_carrier(X1)))) )
=> ? [X3] :
( element(X3,powerset(powerset(the_carrier(X1))))
& ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) ) ) ),
inference(assume_negation,[status(cth)],[s3_subset_1__e2_37_1_1__pre_topc]) ).
cnf(c_0_8,plain,
( in(X1,powerset(the_carrier(X2)))
| ~ in(X1,esk4_2(X2,X3))
| ~ topological_space(X2)
| ~ top_str(X2)
| ~ element(X3,powerset(powerset(the_carrier(X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(esk5_2(X1,X2),X1)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
! [X7] :
( topological_space(esk1_0)
& top_str(esk1_0)
& element(esk2_0,powerset(powerset(the_carrier(esk1_0))))
& ( element(esk3_1(X7),powerset(the_carrier(esk1_0)))
| ~ element(X7,powerset(powerset(the_carrier(esk1_0)))) )
& ( ~ in(esk3_1(X7),X7)
| ~ in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X7)),esk2_0)
| ~ element(X7,powerset(powerset(the_carrier(esk1_0)))) )
& ( in(esk3_1(X7),X7)
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X7)),esk2_0)
| ~ element(X7,powerset(powerset(the_carrier(esk1_0)))) ) ),
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_7])])])])]) ).
cnf(c_0_11,plain,
( in(esk5_2(esk4_2(X1,X2),X3),powerset(the_carrier(X1)))
| element(esk4_2(X1,X2),powerset(X3))
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ top_str(X1)
| ~ topological_space(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
element(esk2_0,powerset(powerset(the_carrier(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( element(X1,powerset(X2))
| ~ in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( in(esk5_2(esk4_2(esk1_0,esk2_0),X1),powerset(the_carrier(esk1_0)))
| element(esk4_2(esk1_0,esk2_0),powerset(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
( in(esk3_1(X1),X1)
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
element(esk4_2(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0)))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_20,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(esk3_1(X1),X1)
| ~ in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( in(set_difference(cast_as_carrier_subset(X1),X2),X3)
| ~ in(X2,esk4_2(X1,X3))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X3,powerset(powerset(the_carrier(X1)))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( in(X1,esk4_2(X2,X3))
| ~ in(X1,powerset(the_carrier(X2)))
| ~ in(set_difference(cast_as_carrier_subset(X2),X1),X3)
| ~ topological_space(X2)
| ~ top_str(X2)
| ~ element(X3,powerset(powerset(the_carrier(X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(esk4_2(esk1_0,esk2_0))),esk2_0)
| in(esk3_1(esk4_2(esk1_0,esk2_0)),esk4_2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_25,plain,
! [X16,X17] :
( ( ~ element(X17,X16)
| in(X17,X16)
| empty(X16) )
& ( ~ in(X17,X16)
| element(X17,X16)
| empty(X16) )
& ( ~ element(X17,X16)
| empty(X17)
| ~ empty(X16) )
& ( ~ empty(X17)
| element(X17,X16)
| ~ empty(X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_26,plain,
! [X47] : ~ empty(powerset(X47)),
inference(variable_rename,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(esk3_1(X1),esk4_2(esk1_0,esk2_0))
| ~ in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_28,negated_conjecture,
( in(esk3_1(esk4_2(esk1_0,esk2_0)),esk4_2(esk1_0,esk2_0))
| ~ in(esk3_1(esk4_2(esk1_0,esk2_0)),powerset(the_carrier(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_29,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( element(esk3_1(X1),powerset(the_carrier(esk1_0)))
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ in(esk3_1(esk4_2(esk1_0,esk2_0)),powerset(the_carrier(esk1_0))),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18])]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( in(esk3_1(X1),powerset(the_carrier(esk1_0)))
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU311+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.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:32:49 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.UPg7zLcwzc/E---3.1_5633.p
% 1.36/0.73 # Version: 3.1pre001
% 1.36/0.73 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.36/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.36/0.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.36/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.36/0.73 # Starting new_bool_1 with 300s (1) cores
% 1.36/0.73 # Starting sh5l with 300s (1) cores
% 1.36/0.73 # new_bool_3 with pid 5759 completed with status 0
% 1.36/0.73 # Result found by new_bool_3
% 1.36/0.73 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.36/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.36/0.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.36/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.36/0.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.36/0.73 # Search class: FGHSS-FFMM21-MFFFFFNN
% 1.36/0.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.36/0.73 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.36/0.73 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 5763 completed with status 0
% 1.36/0.73 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 1.36/0.73 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.36/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.36/0.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.36/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.36/0.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.36/0.73 # Search class: FGHSS-FFMM21-MFFFFFNN
% 1.36/0.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.36/0.73 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.36/0.73 # Preprocessing time : 0.001 s
% 1.36/0.73 # Presaturation interreduction done
% 1.36/0.73
% 1.36/0.73 # Proof found!
% 1.36/0.73 # SZS status Theorem
% 1.36/0.73 # SZS output start CNFRefutation
% See solution above
% 1.36/0.73 # Parsed axioms : 46
% 1.36/0.73 # Removed by relevancy pruning/SinE : 17
% 1.36/0.73 # Initial clauses : 71
% 1.36/0.73 # Removed in clause preprocessing : 0
% 1.36/0.73 # Initial clauses in saturation : 71
% 1.36/0.73 # Processed clauses : 3995
% 1.36/0.73 # ...of these trivial : 31
% 1.36/0.73 # ...subsumed : 2655
% 1.36/0.73 # ...remaining for further processing : 1309
% 1.36/0.73 # Other redundant clauses eliminated : 0
% 1.36/0.73 # Clauses deleted for lack of memory : 0
% 1.36/0.73 # Backward-subsumed : 111
% 1.36/0.73 # Backward-rewritten : 35
% 1.36/0.73 # Generated clauses : 11492
% 1.36/0.73 # ...of the previous two non-redundant : 10732
% 1.36/0.73 # ...aggressively subsumed : 0
% 1.36/0.73 # Contextual simplify-reflections : 10
% 1.36/0.73 # Paramodulations : 11487
% 1.36/0.73 # Factorizations : 0
% 1.36/0.73 # NegExts : 0
% 1.36/0.73 # Equation resolutions : 0
% 1.36/0.73 # Total rewrite steps : 2743
% 1.36/0.73 # Propositional unsat checks : 0
% 1.36/0.73 # Propositional check models : 0
% 1.36/0.73 # Propositional check unsatisfiable : 0
% 1.36/0.73 # Propositional clauses : 0
% 1.36/0.73 # Propositional clauses after purity: 0
% 1.36/0.73 # Propositional unsat core size : 0
% 1.36/0.73 # Propositional preprocessing time : 0.000
% 1.36/0.73 # Propositional encoding time : 0.000
% 1.36/0.73 # Propositional solver time : 0.000
% 1.36/0.73 # Success case prop preproc time : 0.000
% 1.36/0.73 # Success case prop encoding time : 0.000
% 1.36/0.73 # Success case prop solver time : 0.000
% 1.36/0.73 # Current number of processed clauses : 1087
% 1.36/0.73 # Positive orientable unit clauses : 55
% 1.36/0.73 # Positive unorientable unit clauses: 0
% 1.36/0.73 # Negative unit clauses : 15
% 1.36/0.73 # Non-unit-clauses : 1017
% 1.36/0.73 # Current number of unprocessed clauses: 6172
% 1.36/0.73 # ...number of literals in the above : 23437
% 1.36/0.73 # Current number of archived formulas : 0
% 1.36/0.73 # Current number of archived clauses : 222
% 1.36/0.73 # Clause-clause subsumption calls (NU) : 232963
% 1.36/0.73 # Rec. Clause-clause subsumption calls : 153907
% 1.36/0.73 # Non-unit clause-clause subsumptions : 2292
% 1.36/0.73 # Unit Clause-clause subsumption calls : 5002
% 1.36/0.73 # Rewrite failures with RHS unbound : 0
% 1.36/0.73 # BW rewrite match attempts : 64
% 1.36/0.73 # BW rewrite match successes : 16
% 1.36/0.73 # Condensation attempts : 0
% 1.36/0.73 # Condensation successes : 0
% 1.36/0.73 # Termbank termtop insertions : 179196
% 1.36/0.73
% 1.36/0.73 # -------------------------------------------------
% 1.36/0.73 # User time : 0.279 s
% 1.36/0.73 # System time : 0.007 s
% 1.36/0.73 # Total time : 0.286 s
% 1.36/0.73 # Maximum resident set size: 1872 pages
% 1.36/0.73
% 1.36/0.73 # -------------------------------------------------
% 1.36/0.73 # User time : 0.280 s
% 1.36/0.73 # System time : 0.009 s
% 1.36/0.73 # Total time : 0.289 s
% 1.36/0.73 # Maximum resident set size: 1728 pages
% 1.36/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------