TSTP Solution File: SEU167+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU167+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 01:24:04 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP30584/SEU167+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30584/SEU167+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30584/SEU167+3.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 30680
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(subset(X1,X2)=>(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)))),file('/tmp/SRASS.s.p', t118_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(6, conjecture,![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),file('/tmp/SRASS.s.p', t119_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)))),inference(assume_negation,[status(cth)],[6])).
% fof(11, plain,![X1]:![X2]:![X3]:(~(subset(X1,X2))|(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X4]:![X5]:![X6]:(~(subset(X4,X5))|(subset(cartesian_product2(X4,X6),cartesian_product2(X5,X6))&subset(cartesian_product2(X6,X4),cartesian_product2(X6,X5)))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X4]:![X5]:![X6]:((subset(cartesian_product2(X4,X6),cartesian_product2(X5,X6))|~(subset(X4,X5)))&(subset(cartesian_product2(X6,X4),cartesian_product2(X6,X5))|~(subset(X4,X5)))),inference(distribute,[status(thm)],[12])).
% cnf(14,plain,(subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[17])).
% fof(25, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((subset(X1,X2)&subset(X3,X4))&~(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)))),inference(fof_nnf,[status(thm)],[7])).
% fof(26, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((subset(X5,X6)&subset(X7,X8))&~(subset(cartesian_product2(X5,X7),cartesian_product2(X6,X8)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, negated_conjecture,((subset(esk3_0,esk4_0)&subset(esk5_0,esk6_0))&~(subset(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk4_0,esk6_0)))),inference(skolemize,[status(esa)],[26])).
% cnf(28,negated_conjecture,(~subset(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk4_0,esk6_0))),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(34,plain,(subset(X1,cartesian_product2(X2,X3))|~subset(X1,cartesian_product2(X2,X4))|~subset(X4,X3)),inference(spm,[status(thm)],[18,14,theory(equality)])).
% cnf(41,plain,(subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~subset(X2,X4)|~subset(X1,X3)),inference(spm,[status(thm)],[34,15,theory(equality)])).
% cnf(49,negated_conjecture,(~subset(esk5_0,esk6_0)|~subset(esk3_0,esk4_0)),inference(spm,[status(thm)],[28,41,theory(equality)])).
% cnf(50,negated_conjecture,($false|~subset(esk3_0,esk4_0)),inference(rw,[status(thm)],[49,29,theory(equality)])).
% cnf(51,negated_conjecture,($false|$false),inference(rw,[status(thm)],[50,30,theory(equality)])).
% cnf(52,negated_conjecture,($false),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(53,negated_conjecture,($false),52,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 19
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 0
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 30
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 22 leaves, 1.86+/-1.890 terms/leaf
% # Paramod-from index: 7 leaves, 1.29+/-0.700 terms/leaf
% # Paramod-into index: 21 leaves, 1.43+/-1.137 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.005 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP30584/SEU167+3.tptp
%
%------------------------------------------------------------------------------