TSTP Solution File: SEU371+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU371+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:27 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 161 ( 25 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 183 ( 57 ~; 60 |; 62 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 25 ( 23 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 25 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t18_yellow_1,conjecture,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t18_yellow_1) ).
fof(d2_yellow_1,axiom,
! [X1] : boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_yellow_1) ).
fof(d11_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d11_yellow_0) ).
fof(t29_yellow_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& complete_latt_str(X1)
& latt_str(X1) )
=> ! [X2] :
( join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2)
& meet_of_latt_set(X1,X2) = meet_on_relstr(poset_of_lattice(X1),X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t29_yellow_0) ).
fof(dt_k3_lattice3,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& latt_str(X1) )
=> ( strict_rel_str(poset_of_lattice(X1))
& reflexive_relstr(poset_of_lattice(X1))
& transitive_relstr(poset_of_lattice(X1))
& antisymmetric_relstr(poset_of_lattice(X1))
& rel_str(poset_of_lattice(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_lattice3) ).
fof(fc1_knaster,axiom,
! [X1] :
( ~ empty_carrier(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1))
& join_commutative(boole_lattice(X1))
& join_associative(boole_lattice(X1))
& meet_commutative(boole_lattice(X1))
& meet_associative(boole_lattice(X1))
& meet_absorbing(boole_lattice(X1))
& join_absorbing(boole_lattice(X1))
& lattice(boole_lattice(X1))
& distributive_lattstr(boole_lattice(X1))
& modular_lattstr(boole_lattice(X1))
& lower_bounded_semilattstr(boole_lattice(X1))
& upper_bounded_semilattstr(boole_lattice(X1))
& bounded_lattstr(boole_lattice(X1))
& complemented_lattstr(boole_lattice(X1))
& boolean_lattstr(boole_lattice(X1))
& complete_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_knaster) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_lattice3) ).
fof(t3_lattice3,axiom,
! [X1] :
( lower_bounded_semilattstr(boole_lattice(X1))
& bottom_of_semilattstr(boole_lattice(X1)) = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_lattice3) ).
fof(t50_lattice3,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& lattice(X1)
& complete_latt_str(X1)
& latt_str(X1) )
=> ( ~ empty_carrier(X1)
& lattice(X1)
& lower_bounded_semilattstr(X1)
& latt_str(X1)
& bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t50_lattice3) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(assume_negation,[status(cth)],[t18_yellow_1]) ).
fof(c_0_10,negated_conjecture,
bottom_of_relstr(boole_POSet(esk29_0)) != empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_11,plain,
! [X2] : boole_POSet(X2) = poset_of_lattice(boole_lattice(X2)),
inference(variable_rename,[status(thm)],[d2_yellow_1]) ).
fof(c_0_12,plain,
! [X2] :
( ~ rel_str(X2)
| bottom_of_relstr(X2) = join_on_relstr(X2,empty_set) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_yellow_0])]) ).
fof(c_0_13,plain,
! [X3,X4,X4] :
( ( join_of_latt_set(X3,X4) = join_on_relstr(poset_of_lattice(X3),X4)
| empty_carrier(X3)
| ~ lattice(X3)
| ~ complete_latt_str(X3)
| ~ latt_str(X3) )
& ( meet_of_latt_set(X3,X4) = meet_on_relstr(poset_of_lattice(X3),X4)
| empty_carrier(X3)
| ~ lattice(X3)
| ~ complete_latt_str(X3)
| ~ latt_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)],[t29_yellow_0])])])])])])]) ).
fof(c_0_14,plain,
! [X2] :
( ( strict_rel_str(poset_of_lattice(X2))
| empty_carrier(X2)
| ~ lattice(X2)
| ~ latt_str(X2) )
& ( reflexive_relstr(poset_of_lattice(X2))
| empty_carrier(X2)
| ~ lattice(X2)
| ~ latt_str(X2) )
& ( transitive_relstr(poset_of_lattice(X2))
| empty_carrier(X2)
| ~ lattice(X2)
| ~ latt_str(X2) )
& ( antisymmetric_relstr(poset_of_lattice(X2))
| empty_carrier(X2)
| ~ lattice(X2)
| ~ latt_str(X2) )
& ( rel_str(poset_of_lattice(X2))
| empty_carrier(X2)
| ~ lattice(X2)
| ~ latt_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k3_lattice3])])])]) ).
cnf(c_0_15,negated_conjecture,
bottom_of_relstr(boole_POSet(esk29_0)) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( bottom_of_relstr(X1) = join_on_relstr(X1,empty_set)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( empty_carrier(X1)
| join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2)
| ~ latt_str(X1)
| ~ complete_latt_str(X1)
| ~ lattice(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( empty_carrier(X1)
| rel_str(poset_of_lattice(X1))
| ~ latt_str(X1)
| ~ lattice(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2] :
( ~ empty_carrier(boole_lattice(X2))
& strict_latt_str(boole_lattice(X2))
& join_commutative(boole_lattice(X2))
& join_associative(boole_lattice(X2))
& meet_commutative(boole_lattice(X2))
& meet_associative(boole_lattice(X2))
& meet_absorbing(boole_lattice(X2))
& join_absorbing(boole_lattice(X2))
& lattice(boole_lattice(X2))
& distributive_lattstr(boole_lattice(X2))
& modular_lattstr(boole_lattice(X2))
& lower_bounded_semilattstr(boole_lattice(X2))
& upper_bounded_semilattstr(boole_lattice(X2))
& bounded_lattstr(boole_lattice(X2))
& complemented_lattstr(boole_lattice(X2))
& boolean_lattstr(boole_lattice(X2))
& complete_latt_str(boole_lattice(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_knaster])])])]) ).
fof(c_0_21,plain,
! [X2,X2] :
( strict_latt_str(boole_lattice(X2))
& latt_str(boole_lattice(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k1_lattice3])])]) ).
fof(c_0_22,plain,
! [X2,X2] :
( lower_bounded_semilattstr(boole_lattice(X2))
& bottom_of_semilattstr(boole_lattice(X2)) = empty_set ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[t3_lattice3])])]) ).
fof(c_0_23,plain,
! [X2] :
( ( ~ empty_carrier(X2)
| empty_carrier(X2)
| ~ lattice(X2)
| ~ complete_latt_str(X2)
| ~ latt_str(X2) )
& ( lattice(X2)
| empty_carrier(X2)
| ~ lattice(X2)
| ~ complete_latt_str(X2)
| ~ latt_str(X2) )
& ( lower_bounded_semilattstr(X2)
| empty_carrier(X2)
| ~ lattice(X2)
| ~ complete_latt_str(X2)
| ~ latt_str(X2) )
& ( latt_str(X2)
| empty_carrier(X2)
| ~ lattice(X2)
| ~ complete_latt_str(X2)
| ~ latt_str(X2) )
& ( bottom_of_semilattstr(X2) = join_of_latt_set(X2,empty_set)
| empty_carrier(X2)
| ~ lattice(X2)
| ~ complete_latt_str(X2)
| ~ latt_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t50_lattice3])])])]) ).
cnf(c_0_24,negated_conjecture,
bottom_of_relstr(poset_of_lattice(boole_lattice(esk29_0))) != empty_set,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,plain,
( bottom_of_relstr(poset_of_lattice(X1)) = join_of_latt_set(X1,empty_set)
| empty_carrier(X1)
| ~ complete_latt_str(X1)
| ~ lattice(X1)
| ~ latt_str(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,plain,
complete_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( empty_carrier(X1)
| bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set)
| ~ latt_str(X1)
| ~ complete_latt_str(X1)
| ~ lattice(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
join_of_latt_set(boole_lattice(esk29_0),empty_set) != empty_set,
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_24,c_0_25]),c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_33,plain,
join_of_latt_set(boole_lattice(X1),empty_set) = empty_set,
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_30,c_0_31]),c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU371+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n009.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 05:15:23 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.024 s
% 0.24/1.42
% 0.24/1.42 # Failure: Out of unprocessed clauses!
% 0.24/1.42 # OLD status GaveUp
% 0.24/1.42 # Parsed axioms : 115
% 0.24/1.42 # Removed by relevancy pruning/SinE : 62
% 0.24/1.42 # Initial clauses : 280
% 0.24/1.42 # Removed in clause preprocessing : 13
% 0.24/1.42 # Initial clauses in saturation : 267
% 0.24/1.42 # Processed clauses : 294
% 0.24/1.42 # ...of these trivial : 30
% 0.24/1.42 # ...subsumed : 64
% 0.24/1.42 # ...remaining for further processing : 200
% 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 : 4
% 0.24/1.42 # Generated clauses : 69
% 0.24/1.42 # ...of the previous two non-trivial : 29
% 0.24/1.42 # Contextual simplify-reflections : 45
% 0.24/1.42 # Paramodulations : 69
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 196
% 0.24/1.42 # Positive orientable unit clauses : 132
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 14
% 0.24/1.42 # Non-unit-clauses : 50
% 0.24/1.42 # Current number of unprocessed clauses: 0
% 0.24/1.42 # ...number of literals in the above : 0
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 5
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 2263
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 537
% 0.24/1.42 # Non-unit clause-clause subsumptions : 97
% 0.24/1.42 # Unit Clause-clause subsumption calls : 111
% 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 : 11720
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.026 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.031 s
% 0.24/1.42 # Maximum resident set size: 3948 pages
% 0.24/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.029 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 : 35
% 0.24/1.42 # Proof object clause steps : 16
% 0.24/1.42 # Proof object formula steps : 19
% 0.24/1.42 # Proof object conjectures : 7
% 0.24/1.42 # Proof object clause conjectures : 4
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 11
% 0.24/1.42 # Proof object initial formulas used : 9
% 0.24/1.42 # Proof object generating inferences : 3
% 0.24/1.42 # Proof object simplifying inferences : 14
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 115
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 383
% 0.24/1.42 # Removed in clause preprocessing : 23
% 0.24/1.42 # Initial clauses in saturation : 360
% 0.24/1.42 # Processed clauses : 395
% 0.24/1.42 # ...of these trivial : 31
% 0.24/1.42 # ...subsumed : 63
% 0.24/1.42 # ...remaining for further processing : 301
% 0.24/1.42 # Other redundant clauses eliminated : 1
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 4
% 0.24/1.42 # Generated clauses : 178
% 0.24/1.42 # ...of the previous two non-trivial : 128
% 0.24/1.42 # Contextual simplify-reflections : 40
% 0.24/1.42 # Paramodulations : 175
% 0.24/1.42 # Factorizations : 2
% 0.24/1.42 # Equation resolutions : 1
% 0.24/1.42 # Current number of processed clauses : 296
% 0.24/1.42 # Positive orientable unit clauses : 150
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 17
% 0.24/1.42 # Non-unit-clauses : 129
% 0.24/1.42 # Current number of unprocessed clauses: 87
% 0.24/1.42 # ...number of literals in the above : 381
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 5
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 8868
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 1866
% 0.24/1.42 # Non-unit clause-clause subsumptions : 91
% 0.24/1.42 # Unit Clause-clause subsumption calls : 881
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 4
% 0.24/1.42 # BW rewrite match successes : 3
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 18918
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.042 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.045 s
% 0.24/1.42 # Maximum resident set size: 4556 pages
%------------------------------------------------------------------------------