TSTP Solution File: SEU387+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU387+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : 600s
% DateTime : Tue Jul 19 09:19:35 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 17 unt; 0 def)
% Number of atoms : 148 ( 7 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 174 ( 62 ~; 47 |; 57 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 53 ( 23 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_yellow19,conjecture,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_yellow19) ).
fof(t8_waybel_7,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_waybel_7) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(fc7_yellow_1,axiom,
! [X1] :
( ~ empty_carrier(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc7_yellow_1) ).
fof(fc8_yellow_1,axiom,
! [X1] :
( ~ empty_carrier(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& complete_relstr(boole_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc8_yellow_1) ).
fof(t18_yellow_1,axiom,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t18_yellow_1) ).
fof(dt_k3_yellow_1,axiom,
! [X1] :
( strict_rel_str(boole_POSet(X1))
& rel_str(boole_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_yellow_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
inference(assume_negation,[status(cth)],[t2_yellow19]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ( ~ proper_element(X4,powerset(the_carrier(X3)))
| ~ in(bottom_of_relstr(X3),X4)
| empty(X4)
| ~ filtered_subset(X4,X3)
| ~ upper_relstr_subset(X4,X3)
| ~ element(X4,powerset(the_carrier(X3)))
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ antisymmetric_relstr(X3)
| ~ lower_bounded_relstr(X3)
| ~ rel_str(X3) )
& ( in(bottom_of_relstr(X3),X4)
| proper_element(X4,powerset(the_carrier(X3)))
| empty(X4)
| ~ filtered_subset(X4,X3)
| ~ upper_relstr_subset(X4,X3)
| ~ element(X4,powerset(the_carrier(X3)))
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ antisymmetric_relstr(X3)
| ~ lower_bounded_relstr(X3)
| ~ rel_str(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t8_waybel_7])])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_11,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_12,negated_conjecture,
( ~ empty(esk1_0)
& ~ empty(esk2_0)
& filtered_subset(esk2_0,boole_POSet(esk1_0))
& upper_relstr_subset(esk2_0,boole_POSet(esk1_0))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0))))
& element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0))))
& in(esk3_0,esk2_0)
& empty(esk3_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])]) ).
cnf(c_0_13,plain,
( empty_carrier(X1)
| empty(X2)
| ~ rel_str(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ upper_relstr_subset(X2,X1)
| ~ filtered_subset(X2,X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ proper_element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X2,X2,X2,X2,X2] :
( ~ empty_carrier(boole_POSet(X2))
& strict_rel_str(boole_POSet(X2))
& reflexive_relstr(boole_POSet(X2))
& transitive_relstr(boole_POSet(X2))
& antisymmetric_relstr(boole_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc7_yellow_1])])])]) ).
fof(c_0_16,plain,
! [X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2] :
( ~ empty_carrier(boole_POSet(X2))
& strict_rel_str(boole_POSet(X2))
& reflexive_relstr(boole_POSet(X2))
& transitive_relstr(boole_POSet(X2))
& antisymmetric_relstr(boole_POSet(X2))
& lower_bounded_relstr(boole_POSet(X2))
& upper_bounded_relstr(boole_POSet(X2))
& bounded_relstr(boole_POSet(X2))
& with_suprema_relstr(boole_POSet(X2))
& with_infima_relstr(boole_POSet(X2))
& complete_relstr(boole_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc8_yellow_1])])])]) ).
fof(c_0_17,plain,
! [X2] : bottom_of_relstr(boole_POSet(X2)) = empty_set,
inference(variable_rename,[status(thm)],[t18_yellow_1]) ).
fof(c_0_18,plain,
! [X2,X2] :
( strict_rel_str(boole_POSet(X2))
& rel_str(boole_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k3_yellow_1])])]) ).
cnf(c_0_19,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
empty(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( empty_carrier(X1)
| ~ proper_element(X2,powerset(the_carrier(X1)))
| ~ upper_relstr_subset(X2,X1)
| ~ filtered_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ antisymmetric_relstr(X1)
| ~ transitive_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ rel_str(X1) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
antisymmetric_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,plain,
transitive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
lower_bounded_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
reflexive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,plain,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,plain,
rel_str(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
~ empty_carrier(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,negated_conjecture,
empty_set = esk3_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]),c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU387+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 10:05:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.020 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 36
% 0.22/1.41 # Proof object clause steps : 19
% 0.22/1.41 # Proof object formula steps : 17
% 0.22/1.41 # Proof object conjectures : 11
% 0.22/1.41 # Proof object clause conjectures : 8
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 16
% 0.22/1.41 # Proof object initial formulas used : 8
% 0.22/1.41 # Proof object generating inferences : 2
% 0.22/1.41 # Proof object simplifying inferences : 15
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 85
% 0.22/1.41 # Removed by relevancy pruning/SinE : 48
% 0.22/1.41 # Initial clauses : 113
% 0.22/1.41 # Removed in clause preprocessing : 4
% 0.22/1.41 # Initial clauses in saturation : 109
% 0.22/1.41 # Processed clauses : 113
% 0.22/1.41 # ...of these trivial : 5
% 0.22/1.41 # ...subsumed : 2
% 0.22/1.41 # ...remaining for further processing : 105
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 4
% 0.22/1.41 # Generated clauses : 50
% 0.22/1.41 # ...of the previous two non-trivial : 38
% 0.22/1.41 # Contextual simplify-reflections : 1
% 0.22/1.41 # Paramodulations : 50
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 101
% 0.22/1.41 # Positive orientable unit clauses : 59
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 9
% 0.22/1.41 # Non-unit-clauses : 33
% 0.22/1.41 # Current number of unprocessed clauses: 30
% 0.22/1.41 # ...number of literals in the above : 87
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 4
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 750
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 48
% 0.22/1.41 # Non-unit clause-clause subsumptions : 1
% 0.22/1.41 # Unit Clause-clause subsumption calls : 17
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 6335
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.021 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.024 s
% 0.22/1.41 # Maximum resident set size: 3468 pages
% 0.22/23.41 eprover: CPU time limit exceeded, terminating
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------