TSTP Solution File: SET907+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET907+1 : TPTP v5.0.0. Released v3.2.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 00:17:49 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/SystemOnTPTP2942/SET907+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2942/SET907+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2942/SET907+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 3038
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(5, axiom,![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),X3)<=>(in(X1,X3)&in(X2,X3))),file('/tmp/SRASS.s.p', t38_zfmisc_1)).
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2),file('/tmp/SRASS.s.p', t12_xboole_1)).
% fof(12, conjecture,![X1]:![X2]:![X3]:((in(X1,X2)&in(X3,X2))=>set_union2(unordered_pair(X1,X3),X2)=X2),file('/tmp/SRASS.s.p', t48_zfmisc_1)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X3]:((in(X1,X2)&in(X3,X2))=>set_union2(unordered_pair(X1,X3),X2)=X2)),inference(assume_negation,[status(cth)],[12])).
% fof(23, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X1]:![X2]:![X3]:((~(subset(unordered_pair(X1,X2),X3))|(in(X1,X3)&in(X2,X3)))&((~(in(X1,X3))|~(in(X2,X3)))|subset(unordered_pair(X1,X2),X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(28, plain,![X4]:![X5]:![X6]:((~(subset(unordered_pair(X4,X5),X6))|(in(X4,X6)&in(X5,X6)))&((~(in(X4,X6))|~(in(X5,X6)))|subset(unordered_pair(X4,X5),X6))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:(((in(X4,X6)|~(subset(unordered_pair(X4,X5),X6)))&(in(X5,X6)|~(subset(unordered_pair(X4,X5),X6))))&((~(in(X4,X6))|~(in(X5,X6)))|subset(unordered_pair(X4,X5),X6))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X1]:![X2]:(~(subset(X1,X2))|set_union2(X1,X2)=X2),inference(fof_nnf,[status(thm)],[6])).
% fof(34, plain,![X3]:![X4]:(~(subset(X3,X4))|set_union2(X3,X4)=X4),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(set_union2(X1,X2)=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[34])).
% fof(50, negated_conjecture,?[X1]:?[X2]:?[X3]:((in(X1,X2)&in(X3,X2))&~(set_union2(unordered_pair(X1,X3),X2)=X2)),inference(fof_nnf,[status(thm)],[13])).
% fof(51, negated_conjecture,?[X4]:?[X5]:?[X6]:((in(X4,X5)&in(X6,X5))&~(set_union2(unordered_pair(X4,X6),X5)=X5)),inference(variable_rename,[status(thm)],[50])).
% fof(52, negated_conjecture,((in(esk3_0,esk4_0)&in(esk5_0,esk4_0))&~(set_union2(unordered_pair(esk3_0,esk5_0),esk4_0)=esk4_0)),inference(skolemize,[status(esa)],[51])).
% cnf(53,negated_conjecture,(set_union2(unordered_pair(esk3_0,esk5_0),esk4_0)!=esk4_0),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,negated_conjecture,(in(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,negated_conjecture,(in(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(56,negated_conjecture,(set_union2(esk4_0,unordered_pair(esk3_0,esk5_0))!=esk4_0),inference(rw,[status(thm)],[53,24,theory(equality)])).
% cnf(77,plain,(set_union2(unordered_pair(X1,X2),X3)=X3|~in(X2,X3)|~in(X1,X3)),inference(spm,[status(thm)],[35,30,theory(equality)])).
% cnf(96,plain,(X3=set_union2(X3,unordered_pair(X1,X2))|~in(X2,X3)|~in(X1,X3)),inference(spm,[status(thm)],[24,77,theory(equality)])).
% cnf(102,negated_conjecture,(~in(esk5_0,esk4_0)|~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[56,96,theory(equality)])).
% cnf(110,negated_conjecture,($false|~in(esk3_0,esk4_0)),inference(rw,[status(thm)],[102,54,theory(equality)])).
% cnf(111,negated_conjecture,($false|$false),inference(rw,[status(thm)],[110,55,theory(equality)])).
% cnf(112,negated_conjecture,($false),inference(cn,[status(thm)],[111,theory(equality)])).
% cnf(113,negated_conjecture,($false),112,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 55
% # ...of these trivial : 2
% # ...subsumed : 12
% # ...remaining for further processing: 41
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 46
% # ...of the previous two non-trivial : 29
% # Contextual simplify-reflections : 0
% # Paramodulations : 46
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 24
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 6
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 19
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 30
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 25 leaves, 1.64+/-1.162 terms/leaf
% # Paramod-from index: 10 leaves, 1.40+/-0.663 terms/leaf
% # Paramod-into index: 23 leaves, 1.52+/-0.972 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 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/SystemOnTPTP2942/SET907+1.tptp
%
%------------------------------------------------------------------------------