TSTP Solution File: SEU320+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU320+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:37 EDT 2023
% Result : Timeout 74.69s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 70 ( 9 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 66 ( 26 ~; 24 |; 4 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_tops_1,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( open_subset(X2,X1)
<=> closed_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.21ngZX49I1/E---3.1_23574.p',t30_tops_1) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.21ngZX49I1/E---3.1_23574.p',involutiveness_k3_subset_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.21ngZX49I1/E---3.1_23574.p',d5_subset_1) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.21ngZX49I1/E---3.1_23574.p',dt_k3_subset_1) ).
fof(t29_tops_1,lemma,
! [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.21ngZX49I1/E---3.1_23574.p',t29_tops_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( open_subset(X2,X1)
<=> closed_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[t30_tops_1]) ).
fof(c_0_6,plain,
! [X57,X58] :
( ~ element(X58,powerset(X57))
| subset_complement(X57,subset_complement(X57,X58)) = X58 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])]) ).
fof(c_0_7,negated_conjecture,
( top_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& ( ~ open_subset(esk2_0,esk1_0)
| ~ closed_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0) )
& ( open_subset(esk2_0,esk1_0)
| closed_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,plain,
! [X53,X54] :
( ~ element(X54,powerset(X53))
| subset_complement(X53,X54) = set_difference(X53,X54) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])]) ).
fof(c_0_9,plain,
! [X55,X56] :
( ~ element(X56,powerset(X55))
| element(subset_complement(X55,X56),powerset(X55)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])]) ).
cnf(c_0_10,plain,
( subset_complement(X2,subset_complement(X2,X1)) = X1
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset_complement(X2,X1) = set_difference(X2,X1)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( element(subset_complement(X2,X1),powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,lemma,
! [X81,X82] :
( ( ~ closed_subset(X82,X81)
| open_subset(subset_complement(the_carrier(X81),X82),X81)
| ~ element(X82,powerset(the_carrier(X81)))
| ~ top_str(X81) )
& ( ~ open_subset(subset_complement(the_carrier(X81),X82),X81)
| closed_subset(X82,X81)
| ~ element(X82,powerset(the_carrier(X81)))
| ~ top_str(X81) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t29_tops_1])])])]) ).
cnf(c_0_15,negated_conjecture,
subset_complement(the_carrier(esk1_0),subset_complement(the_carrier(esk1_0),esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
subset_complement(the_carrier(esk1_0),esk2_0) = set_difference(the_carrier(esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
element(subset_complement(the_carrier(esk1_0),esk2_0),powerset(the_carrier(esk1_0))),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( open_subset(esk2_0,esk1_0)
| closed_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,
( ~ open_subset(esk2_0,esk1_0)
| ~ closed_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,lemma,
( closed_subset(X2,X1)
| ~ open_subset(subset_complement(the_carrier(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_complement(the_carrier(esk1_0),set_difference(the_carrier(esk1_0),esk2_0)) = esk2_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
element(set_difference(the_carrier(esk1_0),esk2_0),powerset(the_carrier(esk1_0))),
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( closed_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0)
| open_subset(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( ~ closed_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0)
| ~ open_subset(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_26,lemma,
closed_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23])]),c_0_24]) ).
cnf(c_0_27,lemma,
( open_subset(subset_complement(the_carrier(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_28,negated_conjecture,
~ open_subset(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,lemma,
$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_27,c_0_26]),c_0_21]),c_0_22]),c_0_23])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU320+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 09:15:46 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.48 Running first-order model finding
% 0.18/0.48 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.21ngZX49I1/E---3.1_23574.p
% 74.69/300.16 # Version: 3.1pre001
% 74.69/300.16 # Preprocessing class: FSLMSMSSSSSNFFN.
% 74.69/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 74.69/300.16 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 74.69/300.16 # Starting new_bool_3 with 600s (2) cores
% 74.69/300.16 # Starting new_bool_1 with 600s (2) cores
% 74.69/300.16 # Starting sh5l with 300s (1) cores
% 74.69/300.16 # new_bool_1 with pid 23674 completed with status 0
% 74.69/300.16 # Result found by new_bool_1
% 74.69/300.16 # Preprocessing class: FSLMSMSSSSSNFFN.
% 74.69/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 74.69/300.16 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 74.69/300.16 # Starting new_bool_3 with 600s (2) cores
% 74.69/300.16 # Starting new_bool_1 with 600s (2) cores
% 74.69/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 74.69/300.16 # Search class: FGHSM-FSLM31-MFFFFFNN
% 74.69/300.16 # Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 74.69/300.16 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 270s (1) cores
% 74.69/300.16 # Starting new_bool_1 with 61s (1) cores
% 74.69/300.16 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 23676 completed with status 0
% 74.69/300.16 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 74.69/300.16 # Preprocessing class: FSLMSMSSSSSNFFN.
% 74.69/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 74.69/300.16 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 74.69/300.16 # Starting new_bool_3 with 600s (2) cores
% 74.69/300.16 # Starting new_bool_1 with 600s (2) cores
% 74.69/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 74.69/300.16 # Search class: FGHSM-FSLM31-MFFFFFNN
% 74.69/300.16 # Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 74.69/300.16 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 270s (1) cores
% 74.69/300.16 # Preprocessing time : 0.010 s
% 74.69/300.16 # Presaturation interreduction done
% 74.69/300.16
% 74.69/300.16 # Proof found!
% 74.69/300.16 # SZS status Theorem
% 74.69/300.16 # SZS output start CNFRefutation
% See solution above
% 74.69/300.16 # Parsed axioms : 522
% 74.69/300.16 # Removed by relevancy pruning/SinE : 360
% 74.69/300.16 # Initial clauses : 657
% 74.69/300.16 # Removed in clause preprocessing : 2
% 74.69/300.16 # Initial clauses in saturation : 655
% 74.69/300.16 # Processed clauses : 1414
% 74.69/300.16 # ...of these trivial : 18
% 74.69/300.16 # ...subsumed : 330
% 74.69/300.16 # ...remaining for further processing : 1066
% 74.69/300.16 # Other redundant clauses eliminated : 208
% 74.69/300.16 # Clauses deleted for lack of memory : 0
% 74.69/300.16 # Backward-subsumed : 4
% 74.69/300.16 # Backward-rewritten : 44
% 74.69/300.16 # Generated clauses : 1867
% 74.69/300.16 # ...of the previous two non-redundant : 1634
% 74.69/300.16 # ...aggressively subsumed : 0
% 74.69/300.16 # Contextual simplify-reflections : 55
% 74.69/300.16 # Paramodulations : 1689
% 74.69/300.16 # Factorizations : 0
% 74.69/300.16 # NegExts : 0
% 74.69/300.16 # Equation resolutions : 210
% 74.69/300.16 # Total rewrite steps : 671
% 74.69/300.16 # Propositional unsat checks : 0
% 74.69/300.16 # Propositional check models : 0
% 74.69/300.16 # Propositional check unsatisfiable : 0
% 74.69/300.16 # Propositional clauses : 0
% 74.69/300.16 # Propositional clauses after purity: 0
% 74.69/300.16 # Propositional unsat core size : 0
% 74.69/300.16 # Propositional preprocessing time : 0.000
% 74.69/300.16 # Propositional encoding time : 0.000
% 74.69/300.16 # Propositional solver time : 0.000
% 74.69/300.16 # Success case prop preproc time : 0.000
% 74.69/300.16 # Success case prop encoding time : 0.000
% 74.69/300.16 # Success case prop solver time : 0.000
% 74.69/300.16 # Current number of processed clauses : 300
% 74.69/300.16 # Positive orientable unit clauses : 70
% 74.69/300.16 # Positive unorientable unit clauses: 1
% 74.69/300.16 # Negative unit clauses : 30
% 74.69/300.16 # Non-unit-clauses : 199
% 74.69/300.16 # Current number of unprocessed clauses: 1442
% 74.69/300.16 # ...number of literals in the above : 4947
% 74.69/300.16 # Current number of archived formulas : 0
% 74.69/300.16 # Current number of archived clauses : 647
% 74.69/300.16 # Clause-clause subsumption calls (NU) : 217161
% 74.69/300.16 # Rec. Clause-clause subsumption calls : 33456
% 74.69/300.16 # Non-unit clause-clause subsumptions : 258
% 74.69/300.16 # Unit Clause-clause subsumption calls : 659
% 74.69/300.16 # Rewrite failures with RHS unbound : 0
% 74.69/300.16 # BW rewrite match attempts : 78
% 74.69/300.16 # BW rewrite match successes : 26
% 74.69/300.16 # Condensation attempts : 0
% 74.69/300.16 # Condensation successes : 0
% 74.69/300.16 # Termbank termtop insertions : 68863
% 74.69/300.16
% 74.69/300.16 # -------------------------------------------------
% 74.69/300.16 # User time : 0.162 s
% 74.69/300.16 # System time : 0.010 s
% 74.69/300.16 # Total time : 0.172 s
% 74.69/300.16 # Maximum resident set size: 3780 pages
% 74.69/300.16
% 74.69/300.16 # -------------------------------------------------
% 74.69/300.16 # User time : 0.322 s
% 74.69/300.16 # System time : 0.012 s
% 74.69/300.16 # Total time : 0.335 s
% 74.69/300.16 # Maximum resident set size: 2384 pages
% 74.69/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------