TSTP Solution File: SET912+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET912+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:18:19 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/SystemOnTPTP3719/SET912+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3719/SET912+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3719/SET912+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 3815
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_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_intersection2(X1,X2)=X1),file('/tmp/SRASS.s.p', t28_xboole_1)).
% fof(10, conjecture,![X1]:![X2]:![X3]:((in(X1,X2)&in(X3,X2))=>set_intersection2(unordered_pair(X1,X3),X2)=unordered_pair(X1,X3)),file('/tmp/SRASS.s.p', t53_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:((in(X1,X2)&in(X3,X2))=>set_intersection2(unordered_pair(X1,X3),X2)=unordered_pair(X1,X3))),inference(assume_negation,[status(cth)],[10])).
% fof(19, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(23, 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(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(26,plain,(subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X1]:![X2]:(~(subset(X1,X2))|set_intersection2(X1,X2)=X1),inference(fof_nnf,[status(thm)],[6])).
% fof(30, plain,![X3]:![X4]:(~(subset(X3,X4))|set_intersection2(X3,X4)=X3),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(set_intersection2(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(40, negated_conjecture,?[X1]:?[X2]:?[X3]:((in(X1,X2)&in(X3,X2))&~(set_intersection2(unordered_pair(X1,X3),X2)=unordered_pair(X1,X3))),inference(fof_nnf,[status(thm)],[11])).
% fof(41, negated_conjecture,?[X4]:?[X5]:?[X6]:((in(X4,X5)&in(X6,X5))&~(set_intersection2(unordered_pair(X4,X6),X5)=unordered_pair(X4,X6))),inference(variable_rename,[status(thm)],[40])).
% fof(42, negated_conjecture,((in(esk3_0,esk4_0)&in(esk5_0,esk4_0))&~(set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0)=unordered_pair(esk3_0,esk5_0))),inference(skolemize,[status(esa)],[41])).
% cnf(43,negated_conjecture,(set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0)!=unordered_pair(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,negated_conjecture,(in(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,negated_conjecture,(in(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(46,negated_conjecture,(set_intersection2(esk4_0,unordered_pair(esk3_0,esk5_0))!=unordered_pair(esk3_0,esk5_0)),inference(rw,[status(thm)],[43,20,theory(equality)])).
% cnf(52,plain,(X1=set_intersection2(X2,X1)|~subset(X1,X2)),inference(spm,[status(thm)],[20,31,theory(equality)])).
% cnf(77,negated_conjecture,(~subset(unordered_pair(esk3_0,esk5_0),esk4_0)),inference(spm,[status(thm)],[46,52,theory(equality)])).
% cnf(84,negated_conjecture,(~in(esk5_0,esk4_0)|~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[77,26,theory(equality)])).
% cnf(85,negated_conjecture,($false|~in(esk3_0,esk4_0)),inference(rw,[status(thm)],[84,44,theory(equality)])).
% cnf(86,negated_conjecture,($false|$false),inference(rw,[status(thm)],[85,45,theory(equality)])).
% cnf(87,negated_conjecture,($false),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(88,negated_conjecture,($false),87,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 44
% # ...of these trivial : 2
% # ...subsumed : 5
% # ...remaining for further processing: 37
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 32
% # ...of the previous two non-trivial : 25
% # Contextual simplify-reflections : 0
% # Paramodulations : 32
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 7
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 20
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 13
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 23 leaves, 1.61+/-1.010 terms/leaf
% # Paramod-from index: 8 leaves, 1.50+/-0.707 terms/leaf
% # Paramod-into index: 22 leaves, 1.41+/-0.834 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.15 WC
% FINAL PrfWatch: 0.10 CPU 0.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP3719/SET912+1.tptp
%
%------------------------------------------------------------------------------