TSTP Solution File: SEU355+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU355+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:19 EDT 2022
% Result : Theorem 0.28s 1.47s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 129 ( 10 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 148 ( 60 ~; 54 |; 19 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 51 ( 1 sgn 30 !; 3 ?)
% 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(rc2_funct_1,axiom,
? [X1] :
( relation(X1)
& empty(X1)
& function(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc2_funct_1) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_boole) ).
fof(rc1_relat_1,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_relat_1) ).
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_9,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_10,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_11,plain,
( relation(esk18_0)
& empty(esk18_0)
& function(esk18_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_funct_1])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(c_0_13,plain,
( empty(esk15_0)
& relation(esk15_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
fof(c_0_14,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_9])])])])]) ).
cnf(c_0_15,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
empty(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
empty(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,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_14]) ).
cnf(c_0_20,plain,
empty_set = esk18_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( X1 = esk15_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,plain,
empty(esk17_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_23,negated_conjecture,
( ~ relstr_set_smaller(esk1_0,esk18_0,esk2_0)
| ~ relstr_element_smaller(esk1_0,esk18_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
esk18_0 = esk15_0,
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,plain,
empty(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_27,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(esk7_3(X5,X6,X7),the_carrier(X5))
| relstr_set_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( in(esk7_3(X5,X6,X7),X6)
| relstr_set_smaller(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| ~ rel_str(X5) )
& ( ~ related(X5,esk7_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_28,negated_conjecture,
( ~ relstr_set_smaller(esk1_0,esk15_0,esk2_0)
| ~ relstr_element_smaller(esk1_0,esk15_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_29,plain,
esk15_0 = esk17_0,
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_30,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( relstr_set_smaller(X1,X3,X2)
| in(esk7_3(X1,X3,X2),X3)
| ~ rel_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,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_33,negated_conjecture,
( ~ relstr_set_smaller(esk1_0,esk17_0,esk2_0)
| ~ relstr_element_smaller(esk1_0,esk17_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_29]) ).
cnf(c_0_34,plain,
( relstr_set_smaller(X1,X2,X3)
| ~ empty(X2)
| ~ element(X3,the_carrier(X1))
| ~ rel_str(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_36,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_37,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_32]) ).
cnf(c_0_38,negated_conjecture,
~ relstr_element_smaller(esk1_0,esk17_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_33,c_0_34]),c_0_25]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( relstr_element_smaller(X1,X2,X3)
| ~ empty(X2)
| ~ element(X3,the_carrier(X1))
| ~ rel_str(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_40,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_38,c_0_39]),c_0_25]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU355+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n005.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 15:10:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.28/1.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.47 # Preprocessing time : 0.066 s
% 0.28/1.47
% 0.28/1.47 # Proof found!
% 0.28/1.47 # SZS status Theorem
% 0.28/1.47 # SZS output start CNFRefutation
% See solution above
% 0.28/1.47 # Proof object total steps : 41
% 0.28/1.47 # Proof object clause steps : 22
% 0.28/1.47 # Proof object formula steps : 19
% 0.28/1.47 # Proof object conjectures : 11
% 0.28/1.47 # Proof object clause conjectures : 8
% 0.28/1.47 # Proof object formula conjectures : 3
% 0.28/1.47 # Proof object initial clauses used : 11
% 0.28/1.47 # Proof object initial formulas used : 9
% 0.28/1.47 # Proof object generating inferences : 8
% 0.28/1.47 # Proof object simplifying inferences : 14
% 0.28/1.47 # Training examples: 0 positive, 0 negative
% 0.28/1.47 # Parsed axioms : 671
% 0.28/1.47 # Removed by relevancy pruning/SinE : 570
% 0.28/1.47 # Initial clauses : 524
% 0.28/1.47 # Removed in clause preprocessing : 5
% 0.28/1.47 # Initial clauses in saturation : 519
% 0.28/1.47 # Processed clauses : 1126
% 0.28/1.47 # ...of these trivial : 8
% 0.28/1.47 # ...subsumed : 328
% 0.28/1.47 # ...remaining for further processing : 790
% 0.28/1.47 # Other redundant clauses eliminated : 86
% 0.28/1.47 # Clauses deleted for lack of memory : 0
% 0.28/1.47 # Backward-subsumed : 8
% 0.28/1.47 # Backward-rewritten : 32
% 0.28/1.47 # Generated clauses : 5523
% 0.28/1.47 # ...of the previous two non-trivial : 5357
% 0.28/1.47 # Contextual simplify-reflections : 193
% 0.28/1.47 # Paramodulations : 5370
% 0.28/1.47 # Factorizations : 2
% 0.28/1.47 # Equation resolutions : 151
% 0.28/1.47 # Current number of processed clauses : 664
% 0.28/1.47 # Positive orientable unit clauses : 38
% 0.28/1.47 # Positive unorientable unit clauses: 0
% 0.28/1.47 # Negative unit clauses : 19
% 0.28/1.47 # Non-unit-clauses : 607
% 0.28/1.47 # Current number of unprocessed clauses: 4431
% 0.28/1.47 # ...number of literals in the above : 26981
% 0.28/1.47 # Current number of archived formulas : 0
% 0.28/1.47 # Current number of archived clauses : 40
% 0.28/1.47 # Clause-clause subsumption calls (NU) : 120786
% 0.28/1.47 # Rec. Clause-clause subsumption calls : 15922
% 0.28/1.47 # Non-unit clause-clause subsumptions : 494
% 0.28/1.47 # Unit Clause-clause subsumption calls : 6800
% 0.28/1.47 # Rewrite failures with RHS unbound : 0
% 0.28/1.47 # BW rewrite match attempts : 27
% 0.28/1.47 # BW rewrite match successes : 4
% 0.28/1.47 # Condensation attempts : 0
% 0.28/1.47 # Condensation successes : 0
% 0.28/1.47 # Termbank termtop insertions : 148337
% 0.28/1.47
% 0.28/1.47 # -------------------------------------------------
% 0.28/1.47 # User time : 0.276 s
% 0.28/1.47 # System time : 0.009 s
% 0.28/1.47 # Total time : 0.285 s
% 0.28/1.47 # Maximum resident set size: 10640 pages
%------------------------------------------------------------------------------