TSTP Solution File: NUM533+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM533+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 : Wed Dec 29 19:56:45 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP11714/NUM533+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11714/NUM533+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11714/NUM533+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 11810
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,((aSet0(xA)&aSet0(xB))&aSet0(xC)),file('/tmp/SRASS.s.p', m__522)).
% fof(4, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(15, conjecture,((aSubsetOf0(xA,xB)&aSubsetOf0(xB,xC))=>aSubsetOf0(xA,xC)),file('/tmp/SRASS.s.p', m__)).
% fof(16, negated_conjecture,~(((aSubsetOf0(xA,xB)&aSubsetOf0(xB,xC))=>aSubsetOf0(xA,xC))),inference(assume_negation,[status(cth)],[15])).
% cnf(25,plain,(aSet0(xC)),inference(split_conjunct,[status(thm)],[2])).
% cnf(26,plain,(aSet0(xB)),inference(split_conjunct,[status(thm)],[2])).
% cnf(27,plain,(aSet0(xA)),inference(split_conjunct,[status(thm)],[2])).
% fof(32, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(33, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk1_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk1_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(aSubsetOf0(X2,X1)|~aSet0(X1)|~aSet0(X2)|~aElementOf0(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(aSubsetOf0(X2,X1)|aElementOf0(esk1_2(X1,X2),X2)|~aSet0(X1)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(40,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(71, negated_conjecture,((aSubsetOf0(xA,xB)&aSubsetOf0(xB,xC))&~(aSubsetOf0(xA,xC))),inference(fof_nnf,[status(thm)],[16])).
% cnf(72,negated_conjecture,(~aSubsetOf0(xA,xC)),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,negated_conjecture,(aSubsetOf0(xB,xC)),inference(split_conjunct,[status(thm)],[71])).
% cnf(74,negated_conjecture,(aSubsetOf0(xA,xB)),inference(split_conjunct,[status(thm)],[71])).
% cnf(104,negated_conjecture,(aElementOf0(X1,xC)|~aElementOf0(X1,xB)|~aSet0(xC)),inference(spm,[status(thm)],[40,73,theory(equality)])).
% cnf(105,negated_conjecture,(aElementOf0(X1,xB)|~aElementOf0(X1,xA)|~aSet0(xB)),inference(spm,[status(thm)],[40,74,theory(equality)])).
% cnf(107,negated_conjecture,(aElementOf0(X1,xC)|~aElementOf0(X1,xB)|$false),inference(rw,[status(thm)],[104,25,theory(equality)])).
% cnf(108,negated_conjecture,(aElementOf0(X1,xC)|~aElementOf0(X1,xB)),inference(cn,[status(thm)],[107,theory(equality)])).
% cnf(109,negated_conjecture,(aElementOf0(X1,xB)|~aElementOf0(X1,xA)|$false),inference(rw,[status(thm)],[105,26,theory(equality)])).
% cnf(110,negated_conjecture,(aElementOf0(X1,xB)|~aElementOf0(X1,xA)),inference(cn,[status(thm)],[109,theory(equality)])).
% cnf(139,negated_conjecture,(aSubsetOf0(X1,xC)|~aSet0(X1)|~aSet0(xC)|~aElementOf0(esk1_2(xC,X1),xB)),inference(spm,[status(thm)],[37,108,theory(equality)])).
% cnf(142,negated_conjecture,(aSubsetOf0(X1,xC)|~aSet0(X1)|$false|~aElementOf0(esk1_2(xC,X1),xB)),inference(rw,[status(thm)],[139,25,theory(equality)])).
% cnf(143,negated_conjecture,(aSubsetOf0(X1,xC)|~aSet0(X1)|~aElementOf0(esk1_2(xC,X1),xB)),inference(cn,[status(thm)],[142,theory(equality)])).
% cnf(148,negated_conjecture,(aElementOf0(esk1_2(X1,xA),xB)|aSubsetOf0(xA,X1)|~aSet0(xA)|~aSet0(X1)),inference(spm,[status(thm)],[110,38,theory(equality)])).
% cnf(152,negated_conjecture,(aElementOf0(esk1_2(X1,xA),xB)|aSubsetOf0(xA,X1)|$false|~aSet0(X1)),inference(rw,[status(thm)],[148,27,theory(equality)])).
% cnf(153,negated_conjecture,(aElementOf0(esk1_2(X1,xA),xB)|aSubsetOf0(xA,X1)|~aSet0(X1)),inference(cn,[status(thm)],[152,theory(equality)])).
% cnf(189,negated_conjecture,(aSubsetOf0(xA,xC)|~aSet0(xA)|~aSet0(xC)),inference(spm,[status(thm)],[143,153,theory(equality)])).
% cnf(197,negated_conjecture,(aSubsetOf0(xA,xC)|$false|~aSet0(xC)),inference(rw,[status(thm)],[189,27,theory(equality)])).
% cnf(198,negated_conjecture,(aSubsetOf0(xA,xC)|$false|$false),inference(rw,[status(thm)],[197,25,theory(equality)])).
% cnf(199,negated_conjecture,(aSubsetOf0(xA,xC)),inference(cn,[status(thm)],[198,theory(equality)])).
% cnf(200,negated_conjecture,($false),inference(sr,[status(thm)],[199,72,theory(equality)])).
% cnf(201,negated_conjecture,($false),200,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 79
% # ...of these trivial : 1
% # ...subsumed : 14
% # ...remaining for further processing: 64
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 56
% # ...of the previous two non-trivial : 43
% # Contextual simplify-reflections : 11
% # Paramodulations : 56
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 14
% # Clause-clause subsumption calls (NU) : 65
% # Rec. Clause-clause subsumption calls : 52
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 42 leaves, 1.21+/-0.599 terms/leaf
% # Paramod-from index: 20 leaves, 1.05+/-0.218 terms/leaf
% # Paramod-into index: 38 leaves, 1.18+/-0.555 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP11714/NUM533+1.tptp
%
%------------------------------------------------------------------------------