TSTP Solution File: SET027+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET027+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 22:57:28 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP28962/SET027+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28962/SET027+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28962/SET027+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 29094
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(3, conjecture,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', prove_transitivity_of_subset)).
% fof(4, negated_conjecture,~(![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(6, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[5])).
% fof(7, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[6])).
% fof(8, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[7])).
% fof(9, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[8])).
% cnf(10,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(12,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[9])).
% fof(15, negated_conjecture,?[X1]:?[X2]:?[X3]:((subset(X1,X2)&subset(X2,X3))&~(subset(X1,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(16, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(X4,X5)&subset(X5,X6))&~(subset(X4,X6))),inference(variable_rename,[status(thm)],[15])).
% fof(17, negated_conjecture,((subset(esk2_0,esk3_0)&subset(esk3_0,esk4_0))&~(subset(esk2_0,esk4_0))),inference(skolemize,[status(esa)],[16])).
% cnf(18,negated_conjecture,(~subset(esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(20,negated_conjecture,(subset(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(23,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[12,19,theory(equality)])).
% cnf(24,negated_conjecture,(member(X1,esk3_0)|~member(X1,esk2_0)),inference(spm,[status(thm)],[12,20,theory(equality)])).
% cnf(26,negated_conjecture,(subset(X1,esk4_0)|~member(esk1_2(X1,esk4_0),esk3_0)),inference(spm,[status(thm)],[10,23,theory(equality)])).
% cnf(28,negated_conjecture,(subset(X1,esk4_0)|~member(esk1_2(X1,esk4_0),esk2_0)),inference(spm,[status(thm)],[26,24,theory(equality)])).
% cnf(33,negated_conjecture,(subset(esk2_0,esk4_0)),inference(spm,[status(thm)],[28,11,theory(equality)])).
% cnf(34,negated_conjecture,($false),inference(sr,[status(thm)],[33,18,theory(equality)])).
% cnf(35,negated_conjecture,($false),34,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 19
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 19
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 10
% # ...of the previous two non-trivial : 5
% # Contextual simplify-reflections : 0
% # Paramodulations : 10
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 21 leaves, 1.19+/-0.499 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.12+/-0.331 terms/leaf
% # -------------------------------------------------
% # User time : 0.005 s
% # System time : 0.007 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP28962/SET027+3.tptp
%
%------------------------------------------------------------------------------