TSTP Solution File: SWV415+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV415+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 : 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 08:57:39 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP26232/SWV415+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26232/SWV415+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26232/SWV415+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 26328
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:i(triple(X1,X3,X4))=i(triple(X2,X3,X5)),file('/tmp/SRASS.s.p', main2_l12)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:i(triple(X1,insert_slb(X2,pair(X4,X5)),X3))=insert_pq(i(triple(X1,X2,X3)),X4),file('/tmp/SRASS.s.p', ax55)).
% fof(12, axiom,![X1]:![X2]:![X3]:![X4]:insert_cpq(triple(X1,X2,X3),X4)=triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),file('/tmp/SRASS.s.p', ax42)).
% fof(64, conjecture,![X1]:![X2]:![X3]:![X4]:i(insert_cpq(triple(X1,X2,X3),X4))=insert_pq(i(triple(X1,X2,X3)),X4),file('/tmp/SRASS.s.p', co2)).
% fof(65, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:i(insert_cpq(triple(X1,X2,X3),X4))=insert_pq(i(triple(X1,X2,X3)),X4)),inference(assume_negation,[status(cth)],[64])).
% fof(79, plain,![X6]:![X7]:![X8]:![X9]:![X10]:i(triple(X6,X8,X9))=i(triple(X7,X8,X10)),inference(variable_rename,[status(thm)],[2])).
% cnf(80,plain,(i(triple(X1,X2,X3))=i(triple(X4,X2,X5))),inference(split_conjunct,[status(thm)],[79])).
% fof(81, plain,![X6]:![X7]:![X8]:![X9]:![X10]:i(triple(X6,insert_slb(X7,pair(X9,X10)),X8))=insert_pq(i(triple(X6,X7,X8)),X9),inference(variable_rename,[status(thm)],[3])).
% cnf(82,plain,(i(triple(X1,insert_slb(X2,pair(X3,X4)),X5))=insert_pq(i(triple(X1,X2,X5)),X3)),inference(split_conjunct,[status(thm)],[81])).
% fof(106, plain,![X5]:![X6]:![X7]:![X8]:insert_cpq(triple(X5,X6,X7),X8)=triple(insert_pqp(X5,X8),insert_slb(X6,pair(X8,bottom)),X7),inference(variable_rename,[status(thm)],[12])).
% cnf(107,plain,(insert_cpq(triple(X1,X2,X3),X4)=triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3)),inference(split_conjunct,[status(thm)],[106])).
% fof(279, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:~(i(insert_cpq(triple(X1,X2,X3),X4))=insert_pq(i(triple(X1,X2,X3)),X4)),inference(fof_nnf,[status(thm)],[65])).
% fof(280, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:~(i(insert_cpq(triple(X5,X6,X7),X8))=insert_pq(i(triple(X5,X6,X7)),X8)),inference(variable_rename,[status(thm)],[279])).
% fof(281, negated_conjecture,~(i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))=insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)),inference(skolemize,[status(esa)],[280])).
% cnf(282,negated_conjecture,(i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))!=insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)),inference(split_conjunct,[status(thm)],[281])).
% cnf(337,plain,(i(insert_cpq(triple(X1,X3,X4),X2))=i(triple(X5,insert_slb(X3,pair(X2,bottom)),X6))),inference(spm,[status(thm)],[80,107,theory(equality)])).
% cnf(1157,plain,(i(insert_cpq(triple(X1,X2,X3),X4))=i(insert_cpq(triple(X7,X2,X8),X4))),inference(spm,[status(thm)],[337,337,theory(equality)])).
% cnf(1169,negated_conjecture,(i(triple(X1,insert_slb(esk6_0,pair(esk8_0,bottom)),X2))!=insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)),inference(spm,[status(thm)],[282,337,theory(equality)])).
% cnf(1179,negated_conjecture,(i(triple(X1,insert_slb(esk6_0,pair(esk8_0,bottom)),X2))!=insert_pq(i(triple(X3,esk6_0,X4)),esk8_0)),inference(spm,[status(thm)],[1169,80,theory(equality)])).
% cnf(1252,negated_conjecture,(i(insert_cpq(triple(X1,esk6_0,X2),esk8_0))!=insert_pq(i(triple(X3,esk6_0,X4)),esk8_0)),inference(spm,[status(thm)],[1179,107,theory(equality)])).
% cnf(1280,negated_conjecture,(i(insert_cpq(triple(X1,esk6_0,X2),esk8_0))!=i(triple(X3,insert_slb(esk6_0,pair(esk8_0,X5)),X4))),inference(spm,[status(thm)],[1252,82,theory(equality)])).
% cnf(1292,negated_conjecture,(i(insert_cpq(triple(X1,esk6_0,X2),esk8_0))!=i(insert_cpq(triple(X3,esk6_0,X4),esk8_0))),inference(spm,[status(thm)],[1280,107,theory(equality)])).
% cnf(1300,negated_conjecture,($false),inference(sr,[status(thm)],[1292,1157,theory(equality)])).
% cnf(1301,negated_conjecture,($false),1300,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 391
% # ...of these trivial : 8
% # ...subsumed : 110
% # ...remaining for further processing: 273
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 868
% # ...of the previous two non-trivial : 760
% # Contextual simplify-reflections : 21
% # Paramodulations : 857
% # Factorizations : 8
% # Equation resolutions : 4
% # Current number of processed clauses: 184
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 26
% # Non-unit-clauses : 124
% # Current number of unprocessed clauses: 541
% # ...number of literals in the above : 1569
% # Clause-clause subsumption calls (NU) : 1050
% # Rec. Clause-clause subsumption calls : 778
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 77
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 180 leaves, 2.22+/-3.240 terms/leaf
% # Paramod-from index: 73 leaves, 1.30+/-0.656 terms/leaf
% # Paramod-into index: 160 leaves, 2.11+/-3.373 terms/leaf
% # -------------------------------------------------
% # User time : 0.062 s
% # System time : 0.005 s
% # Total time : 0.067 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP26232/SWV415+1.tptp
%
%------------------------------------------------------------------------------