TSTP Solution File: SEU139+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU139+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:14:28 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/SystemOnTPTP17607/SEU139+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17607/SEU139+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17607/SEU139+1.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 17703
% 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]:(proper_subset(X1,X2)=>~(proper_subset(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_xboole_0)).
% fof(2, axiom,![X1]:![X2]:~(proper_subset(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_r2_xboole_0)).
% fof(4, axiom,![X1]:![X2]:(proper_subset(X1,X2)<=>(subset(X1,X2)&~(X1=X2))),file('/tmp/SRASS.s.p', d8_xboole_0)).
% fof(6, conjecture,![X1]:![X2]:~((subset(X1,X2)&proper_subset(X2,X1))),file('/tmp/SRASS.s.p', t60_xboole_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:~((subset(X1,X2)&proper_subset(X2,X1)))),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X1]:![X2]:(proper_subset(X1,X2)=>~(proper_subset(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(9, plain,![X1]:![X2]:~(proper_subset(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(10, plain,![X1]:![X2]:(~(proper_subset(X1,X2))|~(proper_subset(X2,X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(11, plain,![X3]:![X4]:(~(proper_subset(X3,X4))|~(proper_subset(X4,X3))),inference(variable_rename,[status(thm)],[10])).
% cnf(12,plain,(~proper_subset(X1,X2)|~proper_subset(X2,X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X3]:![X4]:~(proper_subset(X3,X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(14,plain,(~proper_subset(X1,X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(17, plain,![X1]:![X2]:((~(proper_subset(X1,X2))|(subset(X1,X2)&~(X1=X2)))&((~(subset(X1,X2))|X1=X2)|proper_subset(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(18, plain,![X3]:![X4]:((~(proper_subset(X3,X4))|(subset(X3,X4)&~(X3=X4)))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:(((subset(X3,X4)|~(proper_subset(X3,X4)))&(~(X3=X4)|~(proper_subset(X3,X4))))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(proper_subset(X1,X2)|X1=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(29, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&proper_subset(X2,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(30, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&proper_subset(X4,X3)),inference(variable_rename,[status(thm)],[29])).
% fof(31, negated_conjecture,(subset(esk1_0,esk2_0)&proper_subset(esk2_0,esk1_0)),inference(skolemize,[status(esa)],[30])).
% cnf(32,negated_conjecture,(proper_subset(esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,negated_conjecture,(subset(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[31])).
% cnf(41,negated_conjecture,(~proper_subset(esk1_0,esk2_0)),inference(spm,[status(thm)],[12,32,theory(equality)])).
% cnf(44,negated_conjecture,(esk1_0=esk2_0|~subset(esk1_0,esk2_0)),inference(spm,[status(thm)],[41,20,theory(equality)])).
% cnf(45,negated_conjecture,(esk1_0=esk2_0|$false),inference(rw,[status(thm)],[44,33,theory(equality)])).
% cnf(46,negated_conjecture,(esk1_0=esk2_0),inference(cn,[status(thm)],[45,theory(equality)])).
% cnf(49,negated_conjecture,(proper_subset(esk2_0,esk2_0)),inference(rw,[status(thm)],[32,46,theory(equality)])).
% cnf(50,negated_conjecture,($false),inference(sr,[status(thm)],[49,14,theory(equality)])).
% cnf(51,negated_conjecture,($false),50,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 22
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 21
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 9
% # ...of the previous two non-trivial : 7
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 4
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 5 leaves, 1.80+/-0.980 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.67+/-0.471 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.005 s
% # Total time : 0.011 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/SystemOnTPTP17607/SEU139+1.tptp
%
%------------------------------------------------------------------------------