TSTP Solution File: SET639+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET639+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 : art05.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:20:28 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/SystemOnTPTP2278/SET639+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2278/SET639+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2278/SET639+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 2375
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:(subset(X1,X2)=>intersection(X1,X2)=X1),file('/tmp/SRASS.s.p', subset_intersection)).
% fof(3, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(10, conjecture,![X1]:![X2]:((subset(X1,X2)&intersection(X2,X1)=empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', prove_th121)).
% fof(11, negated_conjecture,~(![X1]:![X2]:((subset(X1,X2)&intersection(X2,X1)=empty_set)=>X1=empty_set)),inference(assume_negation,[status(cth)],[10])).
% fof(14, plain,![X1]:![X2]:(~(subset(X1,X2))|intersection(X1,X2)=X1),inference(fof_nnf,[status(thm)],[1])).
% fof(15, plain,![X3]:![X4]:(~(subset(X3,X4))|intersection(X3,X4)=X3),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(intersection(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[15])).
% fof(23, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(58, negated_conjecture,?[X1]:?[X2]:((subset(X1,X2)&intersection(X2,X1)=empty_set)&~(X1=empty_set)),inference(fof_nnf,[status(thm)],[11])).
% fof(59, negated_conjecture,?[X3]:?[X4]:((subset(X3,X4)&intersection(X4,X3)=empty_set)&~(X3=empty_set)),inference(variable_rename,[status(thm)],[58])).
% fof(60, negated_conjecture,((subset(esk4_0,esk5_0)&intersection(esk5_0,esk4_0)=empty_set)&~(esk4_0=empty_set)),inference(skolemize,[status(esa)],[59])).
% cnf(61,negated_conjecture,(esk4_0!=empty_set),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,negated_conjecture,(intersection(esk5_0,esk4_0)=empty_set),inference(split_conjunct,[status(thm)],[60])).
% cnf(63,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[60])).
% cnf(68,negated_conjecture,(intersection(esk4_0,esk5_0)=empty_set),inference(rw,[status(thm)],[62,24,theory(equality)])).
% cnf(69,negated_conjecture,(esk4_0=empty_set|~subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[68,16,theory(equality)])).
% cnf(72,negated_conjecture,(esk4_0=empty_set|$false),inference(rw,[status(thm)],[69,63,theory(equality)])).
% cnf(73,negated_conjecture,(esk4_0=empty_set),inference(cn,[status(thm)],[72,theory(equality)])).
% cnf(74,negated_conjecture,($false),inference(sr,[status(thm)],[73,61,theory(equality)])).
% cnf(75,negated_conjecture,($false),74,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 28
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 5
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 27
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 9 leaves, 1.22+/-0.416 terms/leaf
% # Paramod-from index: 4 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 8 leaves, 1.12+/-0.331 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.005 s
% # Total time : 0.015 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/SystemOnTPTP2278/SET639+3.tptp
%
%------------------------------------------------------------------------------