TSTP Solution File: SEU406+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU406+1 : TPTP v5.0.0. Released v3.4.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 04:57:39 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP31895/SEU406+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31895/SEU406+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31895/SEU406+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 31991
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:k2_xboole_0(X1,k4_xboole_0(X2,X1))=k2_xboole_0(X1,X2),file('/tmp/SRASS.s.p', t39_xboole_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(X3=k2_xboole_0(X1,X2)<=>![X4]:(r2_hidden(X4,X3)<=>(r2_hidden(X4,X1)|r2_hidden(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(5, axiom,![X1]:![X2]:k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(24, conjecture,![X1]:![X2]:![X3]:![X4]:~((((((r2_hidden(X1,k2_xboole_0(X3,X4))&r2_hidden(X2,k2_xboole_0(X3,X4)))&~((r2_hidden(X1,k4_xboole_0(X3,X4))&r2_hidden(X2,k4_xboole_0(X3,X4)))))&~((r2_hidden(X1,X4)&r2_hidden(X2,X4))))&~((r2_hidden(X1,k4_xboole_0(X3,X4))&r2_hidden(X2,X4))))&~((r2_hidden(X1,X4)&r2_hidden(X2,k4_xboole_0(X3,X4)))))),file('/tmp/SRASS.s.p', t1_latsum_1)).
% fof(25, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:~((((((r2_hidden(X1,k2_xboole_0(X3,X4))&r2_hidden(X2,k2_xboole_0(X3,X4)))&~((r2_hidden(X1,k4_xboole_0(X3,X4))&r2_hidden(X2,k4_xboole_0(X3,X4)))))&~((r2_hidden(X1,X4)&r2_hidden(X2,X4))))&~((r2_hidden(X1,k4_xboole_0(X3,X4))&r2_hidden(X2,X4))))&~((r2_hidden(X1,X4)&r2_hidden(X2,k4_xboole_0(X3,X4))))))),inference(assume_negation,[status(cth)],[24])).
% fof(33, plain,![X3]:![X4]:k2_xboole_0(X3,k4_xboole_0(X4,X3))=k2_xboole_0(X3,X4),inference(variable_rename,[status(thm)],[2])).
% cnf(34,plain,(k2_xboole_0(X1,k4_xboole_0(X2,X1))=k2_xboole_0(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:![X3]:((~(X3=k2_xboole_0(X1,X2))|![X4]:((~(r2_hidden(X4,X3))|(r2_hidden(X4,X1)|r2_hidden(X4,X2)))&((~(r2_hidden(X4,X1))&~(r2_hidden(X4,X2)))|r2_hidden(X4,X3))))&(?[X4]:((~(r2_hidden(X4,X3))|(~(r2_hidden(X4,X1))&~(r2_hidden(X4,X2))))&(r2_hidden(X4,X3)|(r2_hidden(X4,X1)|r2_hidden(X4,X2))))|X3=k2_xboole_0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(36, plain,![X5]:![X6]:![X7]:((~(X7=k2_xboole_0(X5,X6))|![X8]:((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))&((~(r2_hidden(X8,X5))&~(r2_hidden(X8,X6)))|r2_hidden(X8,X7))))&(?[X9]:((~(r2_hidden(X9,X7))|(~(r2_hidden(X9,X5))&~(r2_hidden(X9,X6))))&(r2_hidden(X9,X7)|(r2_hidden(X9,X5)|r2_hidden(X9,X6))))|X7=k2_xboole_0(X5,X6))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:((~(X7=k2_xboole_0(X5,X6))|![X8]:((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))&((~(r2_hidden(X8,X5))&~(r2_hidden(X8,X6)))|r2_hidden(X8,X7))))&(((~(r2_hidden(esk1_3(X5,X6,X7),X7))|(~(r2_hidden(esk1_3(X5,X6,X7),X5))&~(r2_hidden(esk1_3(X5,X6,X7),X6))))&(r2_hidden(esk1_3(X5,X6,X7),X7)|(r2_hidden(esk1_3(X5,X6,X7),X5)|r2_hidden(esk1_3(X5,X6,X7),X6))))|X7=k2_xboole_0(X5,X6))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X5]:![X6]:![X7]:![X8]:((((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))&((~(r2_hidden(X8,X5))&~(r2_hidden(X8,X6)))|r2_hidden(X8,X7)))|~(X7=k2_xboole_0(X5,X6)))&(((~(r2_hidden(esk1_3(X5,X6,X7),X7))|(~(r2_hidden(esk1_3(X5,X6,X7),X5))&~(r2_hidden(esk1_3(X5,X6,X7),X6))))&(r2_hidden(esk1_3(X5,X6,X7),X7)|(r2_hidden(esk1_3(X5,X6,X7),X5)|r2_hidden(esk1_3(X5,X6,X7),X6))))|X7=k2_xboole_0(X5,X6))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X8]:((((~(r2_hidden(X8,X7))|(r2_hidden(X8,X5)|r2_hidden(X8,X6)))|~(X7=k2_xboole_0(X5,X6)))&(((~(r2_hidden(X8,X5))|r2_hidden(X8,X7))|~(X7=k2_xboole_0(X5,X6)))&((~(r2_hidden(X8,X6))|r2_hidden(X8,X7))|~(X7=k2_xboole_0(X5,X6)))))&((((~(r2_hidden(esk1_3(X5,X6,X7),X5))|~(r2_hidden(esk1_3(X5,X6,X7),X7)))|X7=k2_xboole_0(X5,X6))&((~(r2_hidden(esk1_3(X5,X6,X7),X6))|~(r2_hidden(esk1_3(X5,X6,X7),X7)))|X7=k2_xboole_0(X5,X6)))&((r2_hidden(esk1_3(X5,X6,X7),X7)|(r2_hidden(esk1_3(X5,X6,X7),X5)|r2_hidden(esk1_3(X5,X6,X7),X6)))|X7=k2_xboole_0(X5,X6)))),inference(distribute,[status(thm)],[38])).
% cnf(45,plain,(r2_hidden(X4,X3)|r2_hidden(X4,X2)|X1!=k2_xboole_0(X2,X3)|~r2_hidden(X4,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(49, plain,![X3]:![X4]:k2_xboole_0(X3,X4)=k2_xboole_0(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(50,plain,(k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(91, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(((((r2_hidden(X1,k2_xboole_0(X3,X4))&r2_hidden(X2,k2_xboole_0(X3,X4)))&(~(r2_hidden(X1,k4_xboole_0(X3,X4)))|~(r2_hidden(X2,k4_xboole_0(X3,X4)))))&(~(r2_hidden(X1,X4))|~(r2_hidden(X2,X4))))&(~(r2_hidden(X1,k4_xboole_0(X3,X4)))|~(r2_hidden(X2,X4))))&(~(r2_hidden(X1,X4))|~(r2_hidden(X2,k4_xboole_0(X3,X4))))),inference(fof_nnf,[status(thm)],[25])).
% fof(92, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(((((r2_hidden(X5,k2_xboole_0(X7,X8))&r2_hidden(X6,k2_xboole_0(X7,X8)))&(~(r2_hidden(X5,k4_xboole_0(X7,X8)))|~(r2_hidden(X6,k4_xboole_0(X7,X8)))))&(~(r2_hidden(X5,X8))|~(r2_hidden(X6,X8))))&(~(r2_hidden(X5,k4_xboole_0(X7,X8)))|~(r2_hidden(X6,X8))))&(~(r2_hidden(X5,X8))|~(r2_hidden(X6,k4_xboole_0(X7,X8))))),inference(variable_rename,[status(thm)],[91])).
% fof(93, negated_conjecture,(((((r2_hidden(esk5_0,k2_xboole_0(esk7_0,esk8_0))&r2_hidden(esk6_0,k2_xboole_0(esk7_0,esk8_0)))&(~(r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0)))|~(r2_hidden(esk6_0,k4_xboole_0(esk7_0,esk8_0)))))&(~(r2_hidden(esk5_0,esk8_0))|~(r2_hidden(esk6_0,esk8_0))))&(~(r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0)))|~(r2_hidden(esk6_0,esk8_0))))&(~(r2_hidden(esk5_0,esk8_0))|~(r2_hidden(esk6_0,k4_xboole_0(esk7_0,esk8_0))))),inference(skolemize,[status(esa)],[92])).
% cnf(94,negated_conjecture,(~r2_hidden(esk6_0,k4_xboole_0(esk7_0,esk8_0))|~r2_hidden(esk5_0,esk8_0)),inference(split_conjunct,[status(thm)],[93])).
% cnf(95,negated_conjecture,(~r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[93])).
% cnf(96,negated_conjecture,(~r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,esk8_0)),inference(split_conjunct,[status(thm)],[93])).
% cnf(97,negated_conjecture,(~r2_hidden(esk6_0,k4_xboole_0(esk7_0,esk8_0))|~r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[93])).
% cnf(98,negated_conjecture,(r2_hidden(esk6_0,k2_xboole_0(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[93])).
% cnf(99,negated_conjecture,(r2_hidden(esk5_0,k2_xboole_0(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[93])).
% cnf(100,negated_conjecture,(r2_hidden(esk6_0,k2_xboole_0(esk8_0,esk7_0))),inference(rw,[status(thm)],[98,50,theory(equality)])).
% cnf(101,negated_conjecture,(r2_hidden(esk5_0,k2_xboole_0(esk8_0,esk7_0))),inference(rw,[status(thm)],[99,50,theory(equality)])).
% cnf(151,plain,(r2_hidden(X1,X2)|r2_hidden(X1,X3)|~r2_hidden(X1,k2_xboole_0(X3,X2))),inference(er,[status(thm)],[45,theory(equality)])).
% cnf(410,plain,(r2_hidden(X1,X2)|r2_hidden(X1,k4_xboole_0(X3,X2))|~r2_hidden(X1,k2_xboole_0(X2,X3))),inference(spm,[status(thm)],[151,34,theory(equality)])).
% cnf(3336,negated_conjecture,(r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,esk8_0)|~r2_hidden(esk6_0,k2_xboole_0(esk8_0,esk7_0))),inference(spm,[status(thm)],[94,410,theory(equality)])).
% cnf(3337,negated_conjecture,(r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0))|~r2_hidden(esk6_0,k2_xboole_0(esk8_0,esk7_0))),inference(spm,[status(thm)],[97,410,theory(equality)])).
% cnf(3372,negated_conjecture,(r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,esk8_0)|$false),inference(rw,[status(thm)],[3336,100,theory(equality)])).
% cnf(3373,negated_conjecture,(r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,esk8_0)),inference(cn,[status(thm)],[3372,theory(equality)])).
% cnf(3374,negated_conjecture,(r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0))|$false),inference(rw,[status(thm)],[3337,100,theory(equality)])).
% cnf(3375,negated_conjecture,(r2_hidden(esk6_0,esk8_0)|~r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0))),inference(cn,[status(thm)],[3374,theory(equality)])).
% cnf(3380,negated_conjecture,(~r2_hidden(esk5_0,esk8_0)),inference(csr,[status(thm)],[3373,96])).
% cnf(3456,negated_conjecture,(~r2_hidden(esk5_0,k4_xboole_0(esk7_0,esk8_0))),inference(csr,[status(thm)],[3375,95])).
% cnf(3476,negated_conjecture,(r2_hidden(esk5_0,esk8_0)|~r2_hidden(esk5_0,k2_xboole_0(esk8_0,esk7_0))),inference(spm,[status(thm)],[3456,410,theory(equality)])).
% cnf(3479,negated_conjecture,(r2_hidden(esk5_0,esk8_0)|$false),inference(rw,[status(thm)],[3476,101,theory(equality)])).
% cnf(3480,negated_conjecture,(r2_hidden(esk5_0,esk8_0)),inference(cn,[status(thm)],[3479,theory(equality)])).
% cnf(3481,negated_conjecture,($false),inference(sr,[status(thm)],[3480,3380,theory(equality)])).
% cnf(3482,negated_conjecture,($false),3481,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 446
% # ...of these trivial : 4
% # ...subsumed : 215
% # ...remaining for further processing: 227
% # Other redundant clauses eliminated : 30
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 8
% # Generated clauses : 3118
% # ...of the previous two non-trivial : 2997
% # Contextual simplify-reflections : 21
% # Paramodulations : 3065
% # Factorizations : 12
% # Equation resolutions : 34
% # Current number of processed clauses: 177
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 11
% # Non-unit-clauses : 145
% # Current number of unprocessed clauses: 2405
% # ...number of literals in the above : 12063
% # Clause-clause subsumption calls (NU) : 1901
% # Rec. Clause-clause subsumption calls : 1292
% # Unit Clause-clause subsumption calls : 122
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 18
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 111 leaves, 1.42+/-1.443 terms/leaf
% # Paramod-from index: 49 leaves, 1.20+/-1.160 terms/leaf
% # Paramod-into index: 96 leaves, 1.33+/-1.213 terms/leaf
% # -------------------------------------------------
% # User time : 0.112 s
% # System time : 0.009 s
% # Total time : 0.121 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.33 WC
% FINAL PrfWatch: 0.25 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP31895/SEU406+1.tptp
%
%------------------------------------------------------------------------------