TSTP Solution File: SEU320+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU320+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 63 ( 3 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 69 ( 28 ~; 26 |; 4 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t29_tops_1,axiom,
! [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.Cu7PrJjVEx/E---3.1_3083.p',t29_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.Cu7PrJjVEx/E---3.1_3083.p',involutiveness_k3_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.Cu7PrJjVEx/E---3.1_3083.p',dt_k3_subset_1) ).
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.Cu7PrJjVEx/E---3.1_3083.p',t30_tops_1) ).
fof(c_0_4,plain,
! [X5,X6] :
( ( ~ closed_subset(X6,X5)
| open_subset(subset_complement(the_carrier(X5),X6),X5)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( ~ open_subset(subset_complement(the_carrier(X5),X6),X5)
| closed_subset(X6,X5)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t29_tops_1])])])]) ).
fof(c_0_5,plain,
! [X9,X10] :
( ~ element(X10,powerset(X9))
| subset_complement(X9,subset_complement(X9,X10)) = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])]) ).
fof(c_0_6,plain,
! [X7,X8] :
( ~ element(X8,powerset(X7))
| element(subset_complement(X7,X8),powerset(X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])]) ).
fof(c_0_7,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]) ).
cnf(c_0_8,plain,
( 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_4]) ).
cnf(c_0_9,plain,
( subset_complement(X2,subset_complement(X2,X1)) = X1
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( element(subset_complement(X2,X1),powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,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_7])])]) ).
cnf(c_0_12,plain,
( open_subset(X1,X2)
| ~ closed_subset(subset_complement(the_carrier(X2),X1),X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,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_11]) ).
cnf(c_0_14,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,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_11]) ).
cnf(c_0_17,negated_conjecture,
open_subset(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_18,plain,
( 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_4]) ).
cnf(c_0_19,negated_conjecture,
~ closed_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,plain,
( closed_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ open_subset(X2,X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_9]),c_0_10]) ).
cnf(c_0_21,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_19,c_0_20]),c_0_17]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU320+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n022.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 09:24:09 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.Cu7PrJjVEx/E---3.1_3083.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_1 with pid 3163 completed with status 0
% 0.17/0.45 # Result found by new_bool_1
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # SAT001_MinMin_p005000_rr_RG with pid 3165 completed with status 0
% 0.17/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 14
% 0.17/0.45 # Removed by relevancy pruning/SinE : 8
% 0.17/0.45 # Initial clauses : 10
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 10
% 0.17/0.45 # Processed clauses : 24
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 24
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 2
% 0.17/0.45 # Generated clauses : 10
% 0.17/0.45 # ...of the previous two non-redundant : 5
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 2
% 0.17/0.45 # Paramodulations : 10
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 7
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 12
% 0.17/0.45 # Positive orientable unit clauses : 5
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 1
% 0.17/0.45 # Non-unit-clauses : 6
% 0.17/0.45 # Current number of unprocessed clauses: 1
% 0.17/0.45 # ...number of literals in the above : 5
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 12
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 13
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 2
% 0.17/0.45 # Non-unit clause-clause subsumptions : 2
% 0.17/0.45 # Unit Clause-clause subsumption calls : 0
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 1
% 0.17/0.45 # BW rewrite match successes : 1
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 870
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.003 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.005 s
% 0.17/0.45 # Maximum resident set size: 1704 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.005 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.007 s
% 0.17/0.45 # Maximum resident set size: 1680 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------