TSTP Solution File: SET585+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET585+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 23:12:25 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP28086/SET585+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28086/SET585+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28086/SET585+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 28182
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', transitivity_of_subset)).
% fof(2, axiom,![X1]:![X2]:subset(X1,union(X1,X2)),file('/tmp/SRASS.s.p', subset_of_union)).
% fof(3, axiom,![X1]:![X2]:subset(intersection(X1,X2),X1),file('/tmp/SRASS.s.p', intersection_is_subset)).
% fof(11, conjecture,![X1]:![X2]:![X3]:subset(intersection(X1,X2),union(X1,X3)),file('/tmp/SRASS.s.p', prove_intersection_subset_of_union)).
% fof(12, negated_conjecture,~(![X1]:![X2]:![X3]:subset(intersection(X1,X2),union(X1,X3))),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[1])).
% fof(14, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X3]:![X4]:subset(X3,union(X3,X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(17,plain,(subset(X1,union(X1,X2))),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X3]:![X4]:subset(intersection(X3,X4),X3),inference(variable_rename,[status(thm)],[3])).
% cnf(19,plain,(subset(intersection(X1,X2),X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(55, negated_conjecture,?[X1]:?[X2]:?[X3]:~(subset(intersection(X1,X2),union(X1,X3))),inference(fof_nnf,[status(thm)],[12])).
% fof(56, negated_conjecture,?[X4]:?[X5]:?[X6]:~(subset(intersection(X4,X5),union(X4,X6))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(subset(intersection(esk3_0,esk4_0),union(esk3_0,esk5_0))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~subset(intersection(esk3_0,esk4_0),union(esk3_0,esk5_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(64,plain,(subset(X1,union(X2,X3))|~subset(X1,X2)),inference(spm,[status(thm)],[15,17,theory(equality)])).
% cnf(150,negated_conjecture,(~subset(intersection(esk3_0,esk4_0),esk3_0)),inference(spm,[status(thm)],[58,64,theory(equality)])).
% cnf(155,negated_conjecture,($false),inference(rw,[status(thm)],[150,19,theory(equality)])).
% cnf(156,negated_conjecture,($false),inference(cn,[status(thm)],[155,theory(equality)])).
% cnf(157,negated_conjecture,($false),156,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 45
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 43
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 84
% # ...of the previous two non-trivial : 60
% # Contextual simplify-reflections : 0
% # Paramodulations : 82
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 1
% # Non-unit-clauses : 14
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 110
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 24 leaves, 1.67+/-0.943 terms/leaf
% # Paramod-from index: 11 leaves, 1.64+/-0.643 terms/leaf
% # Paramod-into index: 22 leaves, 1.59+/-0.834 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.002 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP28086/SET585+3.tptp
%
%------------------------------------------------------------------------------