TSTP Solution File: SEU319+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU319+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:26:35 EDT 2024
% Result : Theorem 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 66 ( 3 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 74 ( 30 ~; 28 |; 4 &)
% ( 3 <=>; 9 =>; 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 : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',d6_pre_topc) ).
fof(t17_pre_topc,axiom,
! [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/sandbox2/benchmark/theBenchmark.p',t17_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_pre_topc) ).
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/sandbox2/benchmark/theBenchmark.p',t29_tops_1) ).
fof(c_0_4,plain,
! [X6,X7] :
( ( ~ closed_subset(X7,X6)
| open_subset(subset_difference(the_carrier(X6),cast_as_carrier_subset(X6),X7),X6)
| ~ element(X7,powerset(the_carrier(X6)))
| ~ top_str(X6) )
& ( ~ open_subset(subset_difference(the_carrier(X6),cast_as_carrier_subset(X6),X7),X6)
| closed_subset(X7,X6)
| ~ element(X7,powerset(the_carrier(X6)))
| ~ top_str(X6) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_pre_topc])])])])]) ).
fof(c_0_5,plain,
! [X12,X13] :
( ~ one_sorted_str(X12)
| ~ element(X13,powerset(the_carrier(X12)))
| subset_complement(the_carrier(X12),X13) = subset_difference(the_carrier(X12),cast_as_carrier_subset(X12),X13) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t17_pre_topc])])])]) ).
fof(c_0_6,plain,
! [X17] :
( ~ top_str(X17)
| one_sorted_str(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
fof(c_0_7,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]) ).
cnf(c_0_8,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_4]) ).
cnf(c_0_9,plain,
( 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_5]) ).
cnf(c_0_10,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
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)))
& ( ~ 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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( closed_subset(X1,X2)
| ~ open_subset(subset_complement(the_carrier(X2),X1),X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ top_str(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,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_11]) ).
cnf(c_0_14,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,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_11]) ).
cnf(c_0_17,negated_conjecture,
closed_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,
( 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_4]) ).
cnf(c_0_19,negated_conjecture,
~ open_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,
( open_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(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.06/0.12 % Problem : SEU319+1 : TPTP v8.2.0. Released v3.3.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n029.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 : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 18:06:38 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Version: 3.1.0
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # new_bool_1 with pid 30531 completed with status 0
% 0.18/0.45 # Result found by new_bool_1
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FGHSF-FFSS31-SFFFFFNN
% 0.18/0.45 # partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.18/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 148s (1) cores
% 0.18/0.45 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 30533 completed with status 0
% 0.18/0.45 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FGHSF-FFSS31-SFFFFFNN
% 0.18/0.45 # partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.18/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 148s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Theorem
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 19
% 0.18/0.45 # Removed by relevancy pruning/SinE : 8
% 0.18/0.45 # Initial clauses : 15
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 15
% 0.18/0.45 # Processed clauses : 20
% 0.18/0.45 # ...of these trivial : 0
% 0.18/0.45 # ...subsumed : 1
% 0.18/0.45 # ...remaining for further processing : 19
% 0.18/0.45 # Other redundant clauses eliminated : 0
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 0
% 0.18/0.45 # Backward-rewritten : 2
% 0.18/0.45 # Generated clauses : 11
% 0.18/0.45 # ...of the previous two non-redundant : 6
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 2
% 0.18/0.45 # Paramodulations : 11
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 0
% 0.18/0.45 # Disequality decompositions : 0
% 0.18/0.45 # Total rewrite steps : 7
% 0.18/0.45 # ...of those cached : 4
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 17
% 0.18/0.45 # Positive orientable unit clauses : 6
% 0.18/0.45 # Positive unorientable unit clauses: 0
% 0.18/0.45 # Negative unit clauses : 1
% 0.18/0.45 # Non-unit-clauses : 10
% 0.18/0.45 # Current number of unprocessed clauses: 1
% 0.18/0.45 # ...number of literals in the above : 5
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 2
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 19
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 9
% 0.18/0.45 # Non-unit clause-clause subsumptions : 3
% 0.18/0.45 # Unit Clause-clause subsumption calls : 1
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 1
% 0.18/0.45 # BW rewrite match successes : 1
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 1294
% 0.18/0.45 # Search garbage collected termcells : 223
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.005 s
% 0.18/0.45 # System time : 0.000 s
% 0.18/0.45 # Total time : 0.005 s
% 0.18/0.45 # Maximum resident set size: 1700 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.006 s
% 0.18/0.45 # System time : 0.001 s
% 0.18/0.45 # Total time : 0.008 s
% 0.18/0.45 # Maximum resident set size: 1700 pages
% 0.18/0.45 % E---3.1 exiting
% 0.18/0.45 % E exiting
%------------------------------------------------------------------------------