TSTP Solution File: SEU123+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU123+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:10:33 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/SystemOnTPTP15680/SEU123+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP15680/SEU123+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15680/SEU123+2.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 15776
% 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]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(4, axiom,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(23, conjecture,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', t3_xboole_1)).
% fof(24, negated_conjecture,~(![X1]:(subset(X1,empty_set)=>X1=empty_set)),inference(assume_negation,[status(cth)],[23])).
% fof(30, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(31, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(41, plain,![X2]:subset(empty_set,X2),inference(variable_rename,[status(thm)],[4])).
% cnf(42,plain,(subset(empty_set,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(114, negated_conjecture,?[X1]:(subset(X1,empty_set)&~(X1=empty_set)),inference(fof_nnf,[status(thm)],[24])).
% fof(115, negated_conjecture,?[X2]:(subset(X2,empty_set)&~(X2=empty_set)),inference(variable_rename,[status(thm)],[114])).
% fof(116, negated_conjecture,(subset(esk8_0,empty_set)&~(esk8_0=empty_set)),inference(skolemize,[status(esa)],[115])).
% cnf(117,negated_conjecture,(esk8_0!=empty_set),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,negated_conjecture,(subset(esk8_0,empty_set)),inference(split_conjunct,[status(thm)],[116])).
% cnf(124,negated_conjecture,(empty_set=esk8_0|~subset(empty_set,esk8_0)),inference(spm,[status(thm)],[33,118,theory(equality)])).
% cnf(126,negated_conjecture,(empty_set=esk8_0|$false),inference(rw,[status(thm)],[124,42,theory(equality)])).
% cnf(127,negated_conjecture,(empty_set=esk8_0),inference(cn,[status(thm)],[126,theory(equality)])).
% cnf(128,negated_conjecture,($false),inference(sr,[status(thm)],[127,117,theory(equality)])).
% cnf(129,negated_conjecture,($false),128,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 47
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # 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: 11
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 24
% # ...number of literals in the above : 58
% # Clause-clause subsumption calls (NU) : 27
% # Rec. Clause-clause subsumption calls : 25
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 14 leaves, 1.14+/-0.515 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.08+/-0.266 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.001 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/SystemOnTPTP15680/SEU123+2.tptp
%
%------------------------------------------------------------------------------