TSTP Solution File: SEU304+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU304+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:18:48 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 9 unt; 0 def)
% Number of atoms : 179 ( 19 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 230 ( 90 ~; 90 |; 32 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 64 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_lattices,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_absorbing(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> below(X1,meet_commut(X1,X2,X3),X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t23_lattices) ).
fof(d3_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_lattices) ).
fof(commutativity_k4_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k4_lattices) ).
fof(d8_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& latt_str(X1) )
=> ( meet_absorbing(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> join(X1,meet(X1,X2,X3),X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_lattices) ).
fof(redefinition_k4_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> meet_commut(X1,X2,X3) = meet(X1,X2,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k4_lattices) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( meet_semilatt_str(X1)
& join_semilatt_str(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l3_lattices) ).
fof(dt_k4_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> element(meet_commut(X1,X2,X3),the_carrier(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k4_lattices) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_absorbing(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> below(X1,meet_commut(X1,X2,X3),X2) ) ) ),
inference(assume_negation,[status(cth)],[t23_lattices]) ).
fof(c_0_8,negated_conjecture,
( ~ empty_carrier(esk1_0)
& meet_commutative(esk1_0)
& meet_absorbing(esk1_0)
& latt_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& element(esk3_0,the_carrier(esk1_0))
& ~ below(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ( ~ below(X4,X5,X6)
| join(X4,X5,X6) = X6
| ~ element(X6,the_carrier(X4))
| ~ element(X5,the_carrier(X4))
| empty_carrier(X4)
| ~ join_semilatt_str(X4) )
& ( join(X4,X5,X6) != X6
| below(X4,X5,X6)
| ~ element(X6,the_carrier(X4))
| ~ element(X5,the_carrier(X4))
| empty_carrier(X4)
| ~ join_semilatt_str(X4) ) ),
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)],[d3_lattices])])])])])])]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( empty_carrier(X4)
| ~ meet_commutative(X4)
| ~ meet_semilatt_str(X4)
| ~ element(X5,the_carrier(X4))
| ~ element(X6,the_carrier(X4))
| meet_commut(X4,X5,X6) = meet_commut(X4,X6,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[commutativity_k4_lattices])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ( ~ meet_absorbing(X4)
| ~ element(X5,the_carrier(X4))
| ~ element(X6,the_carrier(X4))
| join(X4,meet(X4,X5,X6),X6) = X6
| empty_carrier(X4)
| ~ latt_str(X4) )
& ( element(esk6_1(X4),the_carrier(X4))
| meet_absorbing(X4)
| empty_carrier(X4)
| ~ latt_str(X4) )
& ( element(esk7_1(X4),the_carrier(X4))
| meet_absorbing(X4)
| empty_carrier(X4)
| ~ latt_str(X4) )
& ( join(X4,meet(X4,esk6_1(X4),esk7_1(X4)),esk7_1(X4)) != esk7_1(X4)
| meet_absorbing(X4)
| empty_carrier(X4)
| ~ latt_str(X4) ) ),
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)],[inference(fof_simplification,[status(thm)],[d8_lattices])])])])])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( empty_carrier(X4)
| ~ meet_commutative(X4)
| ~ meet_semilatt_str(X4)
| ~ element(X5,the_carrier(X4))
| ~ element(X6,the_carrier(X4))
| meet_commut(X4,X5,X6) = meet(X4,X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[redefinition_k4_lattices])])]) ).
fof(c_0_13,plain,
! [X2] :
( ( meet_semilatt_str(X2)
| ~ latt_str(X2) )
& ( join_semilatt_str(X2)
| ~ latt_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])]) ).
cnf(c_0_14,negated_conjecture,
~ below(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( empty_carrier(X1)
| below(X1,X2,X3)
| ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| join(X1,X2,X3) != X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2)
| empty_carrier(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ meet_commutative(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
meet_commutative(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( empty_carrier(X1)
| join(X1,meet(X1,X2,X3),X3) = X3
| ~ latt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_absorbing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( meet_commut(X1,X2,X3) = meet(X1,X2,X3)
| empty_carrier(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ meet_commutative(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( join(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0) != esk2_0
| ~ join_semilatt_str(esk1_0)
| ~ element(meet_commut(esk1_0,esk2_0,esk3_0),the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( meet_commut(esk1_0,X1,X2) = meet_commut(esk1_0,X2,X1)
| ~ element(X2,the_carrier(esk1_0))
| ~ element(X1,the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_25,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( join(X1,meet_commut(X1,X2,X3),X3) = X3
| empty_carrier(X1)
| ~ meet_absorbing(X1)
| ~ latt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_commutative(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
meet_absorbing(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
latt_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_29,plain,
! [X4,X5,X6] :
( empty_carrier(X4)
| ~ meet_commutative(X4)
| ~ meet_semilatt_str(X4)
| ~ element(X5,the_carrier(X4))
| ~ element(X6,the_carrier(X4))
| element(meet_commut(X4,X5,X6),the_carrier(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k4_lattices])])]) ).
cnf(c_0_30,negated_conjecture,
( join(esk1_0,meet_commut(esk1_0,esk3_0,esk2_0),esk2_0) != esk2_0
| ~ join_semilatt_str(esk1_0)
| ~ element(meet_commut(esk1_0,esk3_0,esk2_0),the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
( join(esk1_0,meet_commut(esk1_0,X1,X2),X2) = X2
| ~ element(X2,the_carrier(esk1_0))
| ~ element(X1,the_carrier(esk1_0)) ),
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_19]),c_0_27]),c_0_28])]),c_0_17]) ).
cnf(c_0_32,plain,
( element(meet_commut(X1,X2,X3),the_carrier(X1))
| empty_carrier(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ meet_commutative(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( ~ join_semilatt_str(esk1_0)
| ~ element(meet_commut(esk1_0,esk3_0,esk2_0),the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]),c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
( element(meet_commut(esk1_0,X1,X2),the_carrier(esk1_0))
| ~ element(X2,the_carrier(esk1_0))
| ~ element(X1,the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
( ~ join_semilatt_str(esk1_0)
| ~ meet_semilatt_str(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]),c_0_25])]) ).
cnf(c_0_36,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,negated_conjecture,
~ meet_semilatt_str(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_22]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : SEU304+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 18:25:54 EDT 2022
% 0.14/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.018 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 : 39
% 0.24/1.42 # Proof object clause steps : 24
% 0.24/1.42 # Proof object formula steps : 15
% 0.24/1.42 # Proof object conjectures : 19
% 0.24/1.42 # Proof object clause conjectures : 16
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 14
% 0.24/1.42 # Proof object initial formulas used : 7
% 0.24/1.42 # Proof object generating inferences : 10
% 0.24/1.42 # Proof object simplifying inferences : 23
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 50
% 0.24/1.42 # Removed by relevancy pruning/SinE : 27
% 0.24/1.42 # Initial clauses : 36
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 36
% 0.24/1.42 # Processed clauses : 63
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 10
% 0.24/1.42 # ...remaining for further processing : 53
% 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 : 2
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 37
% 0.24/1.42 # ...of the previous two non-trivial : 28
% 0.24/1.42 # Contextual simplify-reflections : 9
% 0.24/1.42 # Paramodulations : 37
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 51
% 0.24/1.42 # Positive orientable unit clauses : 12
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 4
% 0.24/1.42 # Non-unit-clauses : 35
% 0.24/1.42 # Current number of unprocessed clauses: 1
% 0.24/1.42 # ...number of literals in the above : 3
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 2
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 373
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 122
% 0.24/1.42 # Non-unit clause-clause subsumptions : 21
% 0.24/1.42 # Unit Clause-clause subsumption calls : 13
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 3861
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.022 s
% 0.24/1.42 # System time : 0.001 s
% 0.24/1.42 # Total time : 0.023 s
% 0.24/1.42 # Maximum resident set size: 3048 pages
%------------------------------------------------------------------------------