TSTP Solution File: SEU319+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU319+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 8.62s 1.74s
% Output : CNFRefutation 8.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 72 ( 9 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 73 ( 29 ~; 27 |; 4 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 27 ( 0 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t29_tops_1,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( closed_subset(X2,X1)
<=> open_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.l7MRNRWeej/E---3.1_12826.p',t29_tops_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.l7MRNRWeej/E---3.1_12826.p',d5_subset_1) ).
fof(t17_pre_topc,lemma,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.l7MRNRWeej/E---3.1_12826.p',t17_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/tmp/tmp.l7MRNRWeej/E---3.1_12826.p',dt_l1_pre_topc) ).
fof(d6_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( closed_subset(X2,X1)
<=> open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.l7MRNRWeej/E---3.1_12826.p',d6_pre_topc) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( closed_subset(X2,X1)
<=> open_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[t29_tops_1]) ).
fof(c_0_6,plain,
! [X36,X37] :
( ~ element(X37,powerset(X36))
| subset_complement(X36,X37) = set_difference(X36,X37) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])]) ).
fof(c_0_7,negated_conjecture,
( top_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& ( ~ closed_subset(esk2_0,esk1_0)
| ~ open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0) )
& ( closed_subset(esk2_0,esk1_0)
| open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,lemma,
! [X47,X48] :
( ~ one_sorted_str(X47)
| ~ element(X48,powerset(the_carrier(X47)))
| subset_complement(the_carrier(X47),X48) = subset_difference(the_carrier(X47),cast_as_carrier_subset(X47),X48) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t17_pre_topc])])]) ).
cnf(c_0_9,plain,
( subset_complement(X2,X1) = set_difference(X2,X1)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,lemma,
( subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
subset_complement(the_carrier(esk1_0),esk2_0) = set_difference(the_carrier(esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X118] :
( ~ top_str(X118)
| one_sorted_str(X118) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
fof(c_0_14,plain,
! [X34,X35] :
( ( ~ closed_subset(X35,X34)
| open_subset(subset_difference(the_carrier(X34),cast_as_carrier_subset(X34),X35),X34)
| ~ element(X35,powerset(the_carrier(X34)))
| ~ top_str(X34) )
& ( ~ open_subset(subset_difference(the_carrier(X34),cast_as_carrier_subset(X34),X35),X34)
| closed_subset(X35,X34)
| ~ element(X35,powerset(the_carrier(X34)))
| ~ top_str(X34) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_pre_topc])])])]) ).
cnf(c_0_15,negated_conjecture,
( subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0) = set_difference(the_carrier(esk1_0),esk2_0)
| ~ one_sorted_str(esk1_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_16,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( closed_subset(esk2_0,esk1_0)
| open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( ~ closed_subset(esk2_0,esk1_0)
| ~ open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( closed_subset(X2,X1)
| ~ open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0) = set_difference(the_carrier(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( closed_subset(esk2_0,esk1_0)
| open_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0) ),
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( ~ closed_subset(esk2_0,esk1_0)
| ~ open_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0) ),
inference(rw,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,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_20,c_0_21]),c_0_17]),c_0_10])]),c_0_22]) ).
cnf(c_0_25,plain,
( open_subset(subset_difference(the_carrier(X2),cast_as_carrier_subset(X2),X1),X2)
| ~ closed_subset(X1,X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
~ open_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_21]),c_0_17]),c_0_10])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.17 % Problem : SEU319+2 : TPTP v8.1.2. Released v3.3.0.
% 0.17/0.19 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n027.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40 % CPULimit : 2400
% 0.19/0.40 % WCLimit : 300
% 0.19/0.40 % DateTime : Mon Oct 2 09:32:45 EDT 2023
% 0.19/0.40 % CPUTime :
% 0.40/0.58 Running first-order theorem proving
% 0.40/0.59 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.l7MRNRWeej/E---3.1_12826.p
% 8.62/1.74 # Version: 3.1pre001
% 8.62/1.74 # Preprocessing class: FSLMSMSSSSSNFFN.
% 8.62/1.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.62/1.74 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 8.62/1.74 # Starting new_bool_3 with 600s (2) cores
% 8.62/1.74 # Starting new_bool_1 with 600s (2) cores
% 8.62/1.74 # Starting sh5l with 300s (1) cores
% 8.62/1.74 # new_bool_3 with pid 12979 completed with status 0
% 8.62/1.74 # Result found by new_bool_3
% 8.62/1.74 # Preprocessing class: FSLMSMSSSSSNFFN.
% 8.62/1.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.62/1.74 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 8.62/1.74 # Starting new_bool_3 with 600s (2) cores
% 8.62/1.74 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.62/1.74 # Search class: FGHSM-FSLM31-MFFFFFNN
% 8.62/1.74 # Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 8.62/1.74 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 270s (1) cores
% 8.62/1.74 # Starting new_bool_3 with 61s (1) cores
% 8.62/1.74 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 12990 completed with status 0
% 8.62/1.74 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 8.62/1.74 # Preprocessing class: FSLMSMSSSSSNFFN.
% 8.62/1.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.62/1.74 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 8.62/1.74 # Starting new_bool_3 with 600s (2) cores
% 8.62/1.74 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.62/1.74 # Search class: FGHSM-FSLM31-MFFFFFNN
% 8.62/1.74 # Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 8.62/1.74 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 270s (1) cores
% 8.62/1.74 # Preprocessing time : 0.013 s
% 8.62/1.74 # Presaturation interreduction done
% 8.62/1.74
% 8.62/1.74 # Proof found!
% 8.62/1.74 # SZS status Theorem
% 8.62/1.74 # SZS output start CNFRefutation
% See solution above
% 8.62/1.74 # Parsed axioms : 521
% 8.62/1.74 # Removed by relevancy pruning/SinE : 344
% 8.62/1.74 # Initial clauses : 693
% 8.62/1.74 # Removed in clause preprocessing : 2
% 8.62/1.74 # Initial clauses in saturation : 691
% 8.62/1.74 # Processed clauses : 6547
% 8.62/1.74 # ...of these trivial : 106
% 8.62/1.74 # ...subsumed : 3508
% 8.62/1.74 # ...remaining for further processing : 2932
% 8.62/1.74 # Other redundant clauses eliminated : 335
% 8.62/1.74 # Clauses deleted for lack of memory : 0
% 8.62/1.74 # Backward-subsumed : 56
% 8.62/1.74 # Backward-rewritten : 325
% 8.62/1.74 # Generated clauses : 37000
% 8.62/1.74 # ...of the previous two non-redundant : 35713
% 8.62/1.74 # ...aggressively subsumed : 0
% 8.62/1.74 # Contextual simplify-reflections : 61
% 8.62/1.74 # Paramodulations : 36685
% 8.62/1.74 # Factorizations : 10
% 8.62/1.74 # NegExts : 0
% 8.62/1.74 # Equation resolutions : 337
% 8.62/1.74 # Total rewrite steps : 20077
% 8.62/1.74 # Propositional unsat checks : 0
% 8.62/1.74 # Propositional check models : 0
% 8.62/1.74 # Propositional check unsatisfiable : 0
% 8.62/1.74 # Propositional clauses : 0
% 8.62/1.74 # Propositional clauses after purity: 0
% 8.62/1.74 # Propositional unsat core size : 0
% 8.62/1.74 # Propositional preprocessing time : 0.000
% 8.62/1.74 # Propositional encoding time : 0.000
% 8.62/1.74 # Propositional solver time : 0.000
% 8.62/1.74 # Success case prop preproc time : 0.000
% 8.62/1.74 # Success case prop encoding time : 0.000
% 8.62/1.74 # Success case prop solver time : 0.000
% 8.62/1.74 # Current number of processed clauses : 1795
% 8.62/1.74 # Positive orientable unit clauses : 234
% 8.62/1.74 # Positive unorientable unit clauses: 1
% 8.62/1.74 # Negative unit clauses : 170
% 8.62/1.74 # Non-unit-clauses : 1390
% 8.62/1.74 # Current number of unprocessed clauses: 30267
% 8.62/1.74 # ...number of literals in the above : 122768
% 8.62/1.74 # Current number of archived formulas : 0
% 8.62/1.74 # Current number of archived clauses : 1016
% 8.62/1.74 # Clause-clause subsumption calls (NU) : 694036
% 8.62/1.74 # Rec. Clause-clause subsumption calls : 215157
% 8.62/1.74 # Non-unit clause-clause subsumptions : 1987
% 8.62/1.74 # Unit Clause-clause subsumption calls : 19846
% 8.62/1.74 # Rewrite failures with RHS unbound : 2
% 8.62/1.74 # BW rewrite match attempts : 317
% 8.62/1.74 # BW rewrite match successes : 59
% 8.62/1.74 # Condensation attempts : 0
% 8.62/1.74 # Condensation successes : 0
% 8.62/1.74 # Termbank termtop insertions : 842668
% 8.62/1.74
% 8.62/1.74 # -------------------------------------------------
% 8.62/1.74 # User time : 1.090 s
% 8.62/1.74 # System time : 0.037 s
% 8.62/1.74 # Total time : 1.127 s
% 8.62/1.74 # Maximum resident set size: 3800 pages
% 8.62/1.74
% 8.62/1.74 # -------------------------------------------------
% 8.62/1.74 # User time : 2.147 s
% 8.62/1.74 # System time : 0.043 s
% 8.62/1.74 # Total time : 2.190 s
% 8.62/1.74 # Maximum resident set size: 2388 pages
% 8.62/1.74 % E---3.1 exiting
% 8.62/1.74 % E---3.1 exiting
%------------------------------------------------------------------------------