TSTP Solution File: SEU350+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU350+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:15 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 121 ( 6 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 148 ( 57 ~; 58 |; 19 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t31_lattice3,conjecture,
! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ! [X3] :
( element(X3,the_carrier(poset_of_lattice(X2)))
=> ( relstr_set_smaller(poset_of_lattice(X2),X1,X3)
<=> latt_element_smaller(X2,cast_to_el_of_lattice(X2,X3),X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t31_lattice3) ).
fof(d4_lattice3,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(poset_of_lattice(X1)))
=> cast_to_el_of_lattice(X1,X2) = X2 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_lattice3) ).
fof(t30_lattice3,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ! [X3] :
( element(X3,the_carrier(X2))
=> ( latt_element_smaller(X2,X3,X1)
<=> relstr_set_smaller(poset_of_lattice(X2),X1,cast_to_el_of_LattPOSet(X2,X3)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t30_lattice3) ).
fof(d3_lattice3,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> cast_to_el_of_LattPOSet(X1,X2) = X2 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_lattice3) ).
fof(dt_k5_lattice3,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1)
& element(X2,the_carrier(poset_of_lattice(X1))) )
=> element(cast_to_el_of_lattice(X1,X2),the_carrier(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k5_lattice3) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ( ~ empty_carrier(X2)
& lattice(X2)
& latt_str(X2) )
=> ! [X3] :
( element(X3,the_carrier(poset_of_lattice(X2)))
=> ( relstr_set_smaller(poset_of_lattice(X2),X1,X3)
<=> latt_element_smaller(X2,cast_to_el_of_lattice(X2,X3),X1) ) ) ),
inference(assume_negation,[status(cth)],[t31_lattice3]) ).
fof(c_0_6,negated_conjecture,
( ~ empty_carrier(esk2_0)
& lattice(esk2_0)
& latt_str(esk2_0)
& element(esk3_0,the_carrier(poset_of_lattice(esk2_0)))
& ( ~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| ~ latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_0) )
& ( relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_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_5])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ lattice(X3)
| ~ latt_str(X3)
| ~ element(X4,the_carrier(poset_of_lattice(X3)))
| cast_to_el_of_lattice(X3,X4) = X4 ),
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)],[d4_lattice3])])])])])]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ( ~ latt_element_smaller(X5,X6,X4)
| relstr_set_smaller(poset_of_lattice(X5),X4,cast_to_el_of_LattPOSet(X5,X6))
| ~ element(X6,the_carrier(X5))
| empty_carrier(X5)
| ~ lattice(X5)
| ~ latt_str(X5) )
& ( ~ relstr_set_smaller(poset_of_lattice(X5),X4,cast_to_el_of_LattPOSet(X5,X6))
| latt_element_smaller(X5,X6,X4)
| ~ element(X6,the_carrier(X5))
| empty_carrier(X5)
| ~ lattice(X5)
| ~ latt_str(X5) ) ),
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)],[t30_lattice3])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_0)
| relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( cast_to_el_of_lattice(X1,X2) = X2
| empty_carrier(X1)
| ~ element(X2,the_carrier(poset_of_lattice(X1)))
| ~ latt_str(X1)
| ~ lattice(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
element(esk3_0,the_carrier(poset_of_lattice(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
lattice(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
latt_str(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( empty_carrier(X1)
| relstr_set_smaller(poset_of_lattice(X1),X3,cast_to_el_of_LattPOSet(X1,X2))
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ element(X2,the_carrier(X1))
| ~ latt_element_smaller(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| latt_element_smaller(esk2_0,esk3_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
fof(c_0_17,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ lattice(X3)
| ~ latt_str(X3)
| ~ element(X4,the_carrier(X3))
| cast_to_el_of_LattPOSet(X3,X4) = X4 ),
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)],[d3_lattice3])])])])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ latt_element_smaller(esk2_0,cast_to_el_of_lattice(esk2_0,esk3_0),esk1_0)
| ~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,cast_to_el_of_LattPOSet(esk2_0,esk3_0))
| relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| ~ element(esk3_0,the_carrier(esk2_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_20,plain,
( cast_to_el_of_LattPOSet(X1,X2) = X2
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ latt_str(X1)
| ~ lattice(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ lattice(X3)
| ~ latt_str(X3)
| ~ element(X4,the_carrier(poset_of_lattice(X3)))
| element(cast_to_el_of_lattice(X3,X4),the_carrier(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k5_lattice3])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| ~ latt_element_smaller(esk2_0,esk3_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_23,plain,
( empty_carrier(X1)
| latt_element_smaller(X1,X2,X3)
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ element(X2,the_carrier(X1))
| ~ relstr_set_smaller(poset_of_lattice(X1),X3,cast_to_el_of_LattPOSet(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
( relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,esk3_0)
| ~ element(esk3_0,the_carrier(esk2_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_25,plain,
( element(cast_to_el_of_lattice(X1,X2),the_carrier(X1))
| empty_carrier(X1)
| ~ element(X2,the_carrier(poset_of_lattice(X1)))
| ~ latt_str(X1)
| ~ lattice(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ relstr_set_smaller(poset_of_lattice(esk2_0),esk1_0,cast_to_el_of_LattPOSet(esk2_0,esk3_0))
| ~ element(esk3_0,the_carrier(esk2_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12]),c_0_13])]),c_0_14]),c_0_24]) ).
cnf(c_0_27,plain,
( element(X1,the_carrier(X2))
| empty_carrier(X2)
| ~ element(X1,the_carrier(poset_of_lattice(X2)))
| ~ lattice(X2)
| ~ latt_str(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_28,negated_conjecture,
~ element(esk3_0,the_carrier(esk2_0)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_12]),c_0_13])]),c_0_14]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_11]),c_0_12]),c_0_13])]),c_0_14]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU350+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n010.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 11:46:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.016 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 30
% 0.23/1.41 # Proof object clause steps : 19
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 16
% 0.23/1.41 # Proof object clause conjectures : 13
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 11
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 8
% 0.23/1.41 # Proof object simplifying inferences : 33
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 65
% 0.23/1.41 # Removed by relevancy pruning/SinE : 57
% 0.23/1.41 # Initial clauses : 14
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 14
% 0.23/1.41 # Processed clauses : 24
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 23
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 22
% 0.23/1.41 # ...of the previous two non-trivial : 18
% 0.23/1.41 # Contextual simplify-reflections : 2
% 0.23/1.41 # Paramodulations : 22
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 22
% 0.23/1.41 # Positive orientable unit clauses : 5
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 15
% 0.23/1.41 # Current number of unprocessed clauses: 8
% 0.23/1.41 # ...number of literals in the above : 34
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 29
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 12
% 0.23/1.41 # Non-unit clause-clause subsumptions : 3
% 0.23/1.41 # Unit Clause-clause subsumption calls : 4
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 2303
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.014 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.018 s
% 0.23/1.41 # Maximum resident set size: 3080 pages
%------------------------------------------------------------------------------