TSTP Solution File: SEU305+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU305+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 03:21:19 EST 2010

% Result   : Theorem 0.96s
% Output   : Solution 0.96s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP4844/SEU305+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP4844/SEU305+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4844/SEU305+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 4940
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:(((((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))&element(X2,the_carrier(X1)))&element(X3,the_carrier(X1)))=>join_commut(X1,X2,X3)=join_commut(X1,X3,X2)),file('/tmp/SRASS.s.p', commutativity_k3_lattices)).
% fof(4, 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('/tmp/SRASS.s.p', d3_lattices)).
% fof(7, axiom,![X1]:![X2]:![X3]:(((((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))&element(X2,the_carrier(X1)))&element(X3,the_carrier(X1)))=>join_commut(X1,X2,X3)=join(X1,X2,X3)),file('/tmp/SRASS.s.p', redefinition_k3_lattices)).
% fof(42, conjecture,![X1]:(((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>((below(X1,X2,X3)&below(X1,X3,X2))=>X2=X3)))),file('/tmp/SRASS.s.p', t26_lattices)).
% fof(43, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>((below(X1,X2,X3)&below(X1,X3,X2))=>X2=X3))))),inference(assume_negation,[status(cth)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:(((((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))&element(X2,the_carrier(X1)))&element(X3,the_carrier(X1)))=>join_commut(X1,X2,X3)=join_commut(X1,X3,X2)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(45, plain,![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)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(48, plain,![X1]:![X2]:![X3]:(((((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))&element(X2,the_carrier(X1)))&element(X3,the_carrier(X1)))=>join_commut(X1,X2,X3)=join(X1,X2,X3)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(57, negated_conjecture,~(![X1]:(((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>((below(X1,X2,X3)&below(X1,X3,X2))=>X2=X3))))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(64, plain,![X1]:![X2]:![X3]:(((((empty_carrier(X1)|~(join_commutative(X1)))|~(join_semilatt_str(X1)))|~(element(X2,the_carrier(X1))))|~(element(X3,the_carrier(X1))))|join_commut(X1,X2,X3)=join_commut(X1,X3,X2)),inference(fof_nnf,[status(thm)],[44])).
% fof(65, plain,![X4]:![X5]:![X6]:(((((empty_carrier(X4)|~(join_commutative(X4)))|~(join_semilatt_str(X4)))|~(element(X5,the_carrier(X4))))|~(element(X6,the_carrier(X4))))|join_commut(X4,X5,X6)=join_commut(X4,X6,X5)),inference(variable_rename,[status(thm)],[64])).
% cnf(66,plain,(join_commut(X1,X2,X3)=join_commut(X1,X3,X2)|empty_carrier(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~join_semilatt_str(X1)|~join_commutative(X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(67, plain,![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)&(~(join(X1,X2,X3)=X3)|below(X1,X2,X3)))))),inference(fof_nnf,[status(thm)],[45])).
% fof(68, plain,![X4]:((empty_carrier(X4)|~(join_semilatt_str(X4)))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,the_carrier(X4)))|((~(below(X4,X5,X6))|join(X4,X5,X6)=X6)&(~(join(X4,X5,X6)=X6)|below(X4,X5,X6)))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:(((~(element(X6,the_carrier(X4)))|((~(below(X4,X5,X6))|join(X4,X5,X6)=X6)&(~(join(X4,X5,X6)=X6)|below(X4,X5,X6))))|~(element(X5,the_carrier(X4))))|(empty_carrier(X4)|~(join_semilatt_str(X4)))),inference(shift_quantors,[status(thm)],[68])).
% fof(70, 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)],[69])).
% cnf(72,plain,(empty_carrier(X1)|join(X1,X2,X3)=X3|~join_semilatt_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~below(X1,X2,X3)),inference(split_conjunct,[status(thm)],[70])).
% fof(79, plain,![X1]:![X2]:![X3]:(((((empty_carrier(X1)|~(join_commutative(X1)))|~(join_semilatt_str(X1)))|~(element(X2,the_carrier(X1))))|~(element(X3,the_carrier(X1))))|join_commut(X1,X2,X3)=join(X1,X2,X3)),inference(fof_nnf,[status(thm)],[48])).
% fof(80, plain,![X4]:![X5]:![X6]:(((((empty_carrier(X4)|~(join_commutative(X4)))|~(join_semilatt_str(X4)))|~(element(X5,the_carrier(X4))))|~(element(X6,the_carrier(X4))))|join_commut(X4,X5,X6)=join(X4,X5,X6)),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(join_commut(X1,X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~join_semilatt_str(X1)|~join_commutative(X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(181, negated_conjecture,?[X1]:(((~(empty_carrier(X1))&join_commutative(X1))&join_semilatt_str(X1))&?[X2]:(element(X2,the_carrier(X1))&?[X3]:(element(X3,the_carrier(X1))&((below(X1,X2,X3)&below(X1,X3,X2))&~(X2=X3))))),inference(fof_nnf,[status(thm)],[57])).
% fof(182, negated_conjecture,?[X4]:(((~(empty_carrier(X4))&join_commutative(X4))&join_semilatt_str(X4))&?[X5]:(element(X5,the_carrier(X4))&?[X6]:(element(X6,the_carrier(X4))&((below(X4,X5,X6)&below(X4,X6,X5))&~(X5=X6))))),inference(variable_rename,[status(thm)],[181])).
% fof(183, negated_conjecture,(((~(empty_carrier(esk8_0))&join_commutative(esk8_0))&join_semilatt_str(esk8_0))&(element(esk9_0,the_carrier(esk8_0))&(element(esk10_0,the_carrier(esk8_0))&((below(esk8_0,esk9_0,esk10_0)&below(esk8_0,esk10_0,esk9_0))&~(esk9_0=esk10_0))))),inference(skolemize,[status(esa)],[182])).
% cnf(184,negated_conjecture,(esk9_0!=esk10_0),inference(split_conjunct,[status(thm)],[183])).
% cnf(185,negated_conjecture,(below(esk8_0,esk10_0,esk9_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(186,negated_conjecture,(below(esk8_0,esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(187,negated_conjecture,(element(esk10_0,the_carrier(esk8_0))),inference(split_conjunct,[status(thm)],[183])).
% cnf(188,negated_conjecture,(element(esk9_0,the_carrier(esk8_0))),inference(split_conjunct,[status(thm)],[183])).
% cnf(189,negated_conjecture,(join_semilatt_str(esk8_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(190,negated_conjecture,(join_commutative(esk8_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(191,negated_conjecture,(~empty_carrier(esk8_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(214,negated_conjecture,(join(esk8_0,esk10_0,esk9_0)=esk9_0|empty_carrier(esk8_0)|~element(esk9_0,the_carrier(esk8_0))|~element(esk10_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(spm,[status(thm)],[72,185,theory(equality)])).
% cnf(215,negated_conjecture,(join(esk8_0,esk9_0,esk10_0)=esk10_0|empty_carrier(esk8_0)|~element(esk10_0,the_carrier(esk8_0))|~element(esk9_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(spm,[status(thm)],[72,186,theory(equality)])).
% cnf(216,negated_conjecture,(join(esk8_0,esk10_0,esk9_0)=esk9_0|empty_carrier(esk8_0)|$false|~element(esk10_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[214,188,theory(equality)])).
% cnf(217,negated_conjecture,(join(esk8_0,esk10_0,esk9_0)=esk9_0|empty_carrier(esk8_0)|$false|$false|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[216,187,theory(equality)])).
% cnf(218,negated_conjecture,(join(esk8_0,esk10_0,esk9_0)=esk9_0|empty_carrier(esk8_0)|$false|$false|$false),inference(rw,[status(thm)],[217,189,theory(equality)])).
% cnf(219,negated_conjecture,(join(esk8_0,esk10_0,esk9_0)=esk9_0|empty_carrier(esk8_0)),inference(cn,[status(thm)],[218,theory(equality)])).
% cnf(220,negated_conjecture,(join(esk8_0,esk10_0,esk9_0)=esk9_0),inference(sr,[status(thm)],[219,191,theory(equality)])).
% cnf(221,negated_conjecture,(join(esk8_0,esk9_0,esk10_0)=esk10_0|empty_carrier(esk8_0)|$false|~element(esk9_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[215,187,theory(equality)])).
% cnf(222,negated_conjecture,(join(esk8_0,esk9_0,esk10_0)=esk10_0|empty_carrier(esk8_0)|$false|$false|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[221,188,theory(equality)])).
% cnf(223,negated_conjecture,(join(esk8_0,esk9_0,esk10_0)=esk10_0|empty_carrier(esk8_0)|$false|$false|$false),inference(rw,[status(thm)],[222,189,theory(equality)])).
% cnf(224,negated_conjecture,(join(esk8_0,esk9_0,esk10_0)=esk10_0|empty_carrier(esk8_0)),inference(cn,[status(thm)],[223,theory(equality)])).
% cnf(225,negated_conjecture,(join(esk8_0,esk9_0,esk10_0)=esk10_0),inference(sr,[status(thm)],[224,191,theory(equality)])).
% cnf(229,plain,(join(X1,X2,X3)=join_commut(X1,X3,X2)|empty_carrier(X1)|~join_commutative(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~join_semilatt_str(X1)),inference(spm,[status(thm)],[66,81,theory(equality)])).
% cnf(312,plain,(join(X1,X3,X2)=join(X1,X2,X3)|empty_carrier(X1)|~join_commutative(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~join_semilatt_str(X1)),inference(spm,[status(thm)],[81,229,theory(equality)])).
% cnf(460,negated_conjecture,(join(esk8_0,esk9_0,esk10_0)=esk9_0|empty_carrier(esk8_0)|~join_commutative(esk8_0)|~element(esk9_0,the_carrier(esk8_0))|~element(esk10_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(spm,[status(thm)],[220,312,theory(equality)])).
% cnf(466,negated_conjecture,(esk10_0=esk9_0|empty_carrier(esk8_0)|~join_commutative(esk8_0)|~element(esk9_0,the_carrier(esk8_0))|~element(esk10_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[460,225,theory(equality)])).
% cnf(467,negated_conjecture,(esk10_0=esk9_0|empty_carrier(esk8_0)|$false|~element(esk9_0,the_carrier(esk8_0))|~element(esk10_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[466,190,theory(equality)])).
% cnf(468,negated_conjecture,(esk10_0=esk9_0|empty_carrier(esk8_0)|$false|$false|~element(esk10_0,the_carrier(esk8_0))|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[467,188,theory(equality)])).
% cnf(469,negated_conjecture,(esk10_0=esk9_0|empty_carrier(esk8_0)|$false|$false|$false|~join_semilatt_str(esk8_0)),inference(rw,[status(thm)],[468,187,theory(equality)])).
% cnf(470,negated_conjecture,(esk10_0=esk9_0|empty_carrier(esk8_0)|$false|$false|$false|$false),inference(rw,[status(thm)],[469,189,theory(equality)])).
% cnf(471,negated_conjecture,(esk10_0=esk9_0|empty_carrier(esk8_0)),inference(cn,[status(thm)],[470,theory(equality)])).
% cnf(472,negated_conjecture,(empty_carrier(esk8_0)),inference(sr,[status(thm)],[471,184,theory(equality)])).
% cnf(473,negated_conjecture,($false),inference(sr,[status(thm)],[472,191,theory(equality)])).
% cnf(474,negated_conjecture,($false),473,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 234
% # ...of these trivial                : 0
% # ...subsumed                        : 50
% # ...remaining for further processing: 184
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 8
% # Backward-rewritten                 : 0
% # Generated clauses                  : 186
% # ...of the previous two non-trivial : 169
% # Contextual simplify-reflections    : 31
% # Paramodulations                    : 177
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 121
% #    Positive orientable unit clauses: 20
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 6
% #    Non-unit-clauses                : 95
% # Current number of unprocessed clauses: 35
% # ...number of literals in the above : 147
% # Clause-clause subsumption calls (NU) : 799
% # Rec. Clause-clause subsumption calls : 635
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   129 leaves,   1.29+/-0.772 terms/leaf
% # Paramod-from index:           53 leaves,   1.08+/-0.264 terms/leaf
% # Paramod-into index:          108 leaves,   1.17+/-0.441 terms/leaf
% # -------------------------------------------------
% # User time              : 0.031 s
% # System time            : 0.005 s
% # Total time             : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP4844/SEU305+1.tptp
% 
%------------------------------------------------------------------------------