TSTP Solution File: SEU355+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU355+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Tue Jul 19 09:19:18 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 100 ( 4 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 122 ( 49 ~; 47 |; 11 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 42 ( 1 sgn 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_yellow_0,conjecture,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( relstr_set_smaller(X1,empty_set,X2)
& relstr_element_smaller(X1,empty_set,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_yellow_0) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(d9_lattice3,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2,X3] :
( element(X3,the_carrier(X1))
=> ( relstr_set_smaller(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X2)
=> related(X1,X4,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_lattice3) ).
fof(d8_lattice3,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2,X3] :
( element(X3,the_carrier(X1))
=> ( relstr_element_smaller(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X2)
=> related(X1,X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_lattice3) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( relstr_set_smaller(X1,empty_set,X2)
& relstr_element_smaller(X1,empty_set,X2) ) ) ),
inference(assume_negation,[status(cth)],[t6_yellow_0]) ).
fof(c_0_7,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_8,plain,
empty(esk7_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_9,negated_conjecture,
( rel_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& ( ~ relstr_set_smaller(esk1_0,empty_set,esk2_0)
| ~ relstr_element_smaller(esk1_0,empty_set,esk2_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)],[c_0_6])])])])]) ).
cnf(c_0_10,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
empty(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8] :
( ( ~ relstr_set_smaller(X5,X6,X7)
| ~ element(X8,the_carrier(X5))
| ~ in(X8,X6)
| related(X5,X8,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( element(esk4_3(X5,X6,X7),the_carrier(X5))
| relstr_set_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( in(esk4_3(X5,X6,X7),X6)
| relstr_set_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( ~ related(X5,esk4_3(X5,X6,X7),X7)
| relstr_set_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_lattice3])])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ relstr_element_smaller(esk1_0,empty_set,esk2_0)
| ~ relstr_set_smaller(esk1_0,empty_set,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
empty_set = esk7_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( relstr_set_smaller(X1,X3,X2)
| in(esk4_3(X1,X3,X2),X3)
| ~ rel_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X5,X6,X7,X8] :
( ( ~ relstr_element_smaller(X5,X6,X7)
| ~ element(X8,the_carrier(X5))
| ~ in(X8,X6)
| related(X5,X7,X8)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( element(esk3_3(X5,X6,X7),the_carrier(X5))
| relstr_element_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( in(esk3_3(X5,X6,X7),X6)
| relstr_element_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( ~ related(X5,X7,esk3_3(X5,X6,X7))
| relstr_element_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_lattice3])])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ relstr_set_smaller(esk1_0,esk7_0,esk2_0)
| ~ relstr_element_smaller(esk1_0,esk7_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_20,plain,
( relstr_set_smaller(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ rel_str(X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( relstr_element_smaller(X1,X3,X2)
| in(esk3_3(X1,X3,X2),X3)
| ~ rel_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
~ relstr_element_smaller(esk1_0,esk7_0,esk2_0),
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_21]),c_0_22]),c_0_11])]) ).
cnf(c_0_25,plain,
( relstr_element_smaller(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ rel_str(X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_26,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_24,c_0_25]),c_0_21]),c_0_22]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU355+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 10:43:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.016 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 27
% 0.24/1.42 # Proof object clause steps : 14
% 0.24/1.42 # Proof object formula steps : 13
% 0.24/1.42 # Proof object conjectures : 9
% 0.24/1.42 # Proof object clause conjectures : 6
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 8
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 5
% 0.24/1.42 # Proof object simplifying inferences : 10
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 22
% 0.24/1.42 # Removed by relevancy pruning/SinE : 8
% 0.24/1.42 # Initial clauses : 22
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 22
% 0.24/1.42 # Processed clauses : 41
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 3
% 0.24/1.42 # ...remaining for further processing : 38
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 3
% 0.24/1.42 # Generated clauses : 28
% 0.24/1.42 # ...of the previous two non-trivial : 26
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 28
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 35
% 0.24/1.42 # Positive orientable unit clauses : 6
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 27
% 0.24/1.42 # Current number of unprocessed clauses: 6
% 0.24/1.42 # ...number of literals in the above : 32
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 3
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 115
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 47
% 0.24/1.42 # Non-unit clause-clause subsumptions : 3
% 0.24/1.42 # Unit Clause-clause subsumption calls : 5
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 1
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1847
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.016 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2960 pages
%------------------------------------------------------------------------------