TSTP Solution File: SWV390+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV390+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 : art05.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:52:46 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP30105/SWV390+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30105/SWV390+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30105/SWV390+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 30201
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:![X3]:(check_cpq(triple(X1,X2,X3))<=>![X4]:![X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4))),file('/tmp/SRASS.s.p', l26_li4142)).
% fof(8, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:(less_than(X5,X4)=>(check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))<=>check_cpq(triple(X1,X2,X3)))),file('/tmp/SRASS.s.p', ax37)).
% 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(24, axiom,![X1]:less_than(bottom,X1),file('/tmp/SRASS.s.p', bottom_smallest)).
% fof(43, conjecture,![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:~(check_cpq(insert_cpq(triple(X1,X2,X3),X4)))),file('/tmp/SRASS.s.p', l26_co)).
% fof(44, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:~(check_cpq(insert_cpq(triple(X1,X2,X3),X4))))),inference(assume_negation,[status(cth)],[43])).
% fof(54, negated_conjecture,~(![X1]:![X2]:![X3]:(~(check_cpq(triple(X1,X2,X3)))=>![X4]:~(check_cpq(insert_cpq(triple(X1,X2,X3),X4))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(69, plain,![X1]:![X2]:![X3]:((~(check_cpq(triple(X1,X2,X3)))|![X4]:![X5]:(~(pair_in_list(X2,X4,X5))|less_than(X5,X4)))&(?[X4]:?[X5]:(pair_in_list(X2,X4,X5)&~(less_than(X5,X4)))|check_cpq(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(70, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&(?[X11]:?[X12]:(pair_in_list(X7,X11,X12)&~(less_than(X12,X11)))|check_cpq(triple(X6,X7,X8)))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(skolemize,[status(esa)],[70])).
% fof(72, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(shift_quantors,[status(thm)],[71])).
% fof(73, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))|check_cpq(triple(X6,X7,X8)))&(~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8)))|check_cpq(triple(X6,X7,X8))))),inference(distribute,[status(thm)],[72])).
% cnf(74,plain,(check_cpq(triple(X1,X2,X3))|~less_than(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(check_cpq(triple(X1,X2,X3))|pair_in_list(X2,esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))),inference(split_conjunct,[status(thm)],[73])).
% cnf(76,plain,(less_than(X4,X5)|~check_cpq(triple(X1,X2,X3))|~pair_in_list(X2,X5,X4)),inference(split_conjunct,[status(thm)],[73])).
% fof(77, plain,![X1]:![X2]:![X3]:![X4]:![X5]:(~(less_than(X5,X4))|((~(check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)))|check_cpq(triple(X1,X2,X3)))&(~(check_cpq(triple(X1,X2,X3)))|check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))))),inference(fof_nnf,[status(thm)],[8])).
% fof(78, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(~(less_than(X10,X9))|((~(check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)))|check_cpq(triple(X6,X7,X8)))&(~(check_cpq(triple(X6,X7,X8)))|check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)))|check_cpq(triple(X6,X7,X8)))|~(less_than(X10,X9)))&((~(check_cpq(triple(X6,X7,X8)))|check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8)))|~(less_than(X10,X9)))),inference(distribute,[status(thm)],[78])).
% cnf(81,plain,(check_cpq(triple(X3,X4,X5))|~less_than(X1,X2)|~check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5))),inference(split_conjunct,[status(thm)],[79])).
% fof(90, 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(91,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)],[90])).
% fof(132, plain,![X2]:less_than(bottom,X2),inference(variable_rename,[status(thm)],[24])).
% cnf(133,plain,(less_than(bottom,X1)),inference(split_conjunct,[status(thm)],[132])).
% fof(180, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(check_cpq(triple(X1,X2,X3)))&?[X4]:check_cpq(insert_cpq(triple(X1,X2,X3),X4))),inference(fof_nnf,[status(thm)],[54])).
% fof(181, negated_conjecture,?[X5]:?[X6]:?[X7]:(~(check_cpq(triple(X5,X6,X7)))&?[X8]:check_cpq(insert_cpq(triple(X5,X6,X7),X8))),inference(variable_rename,[status(thm)],[180])).
% fof(182, negated_conjecture,(~(check_cpq(triple(esk3_0,esk4_0,esk5_0)))&check_cpq(insert_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))),inference(skolemize,[status(esa)],[181])).
% cnf(183,negated_conjecture,(check_cpq(insert_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))),inference(split_conjunct,[status(thm)],[182])).
% cnf(184,negated_conjecture,(~check_cpq(triple(esk3_0,esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[182])).
% cnf(230,plain,(check_cpq(triple(insert_pqp(X1,X2),X3,X4))|~less_than(bottom,X2)|~check_cpq(insert_cpq(triple(X1,X3,X4),X2))),inference(spm,[status(thm)],[81,91,theory(equality)])).
% cnf(232,plain,(check_cpq(triple(insert_pqp(X1,X2),X3,X4))|$false|~check_cpq(insert_cpq(triple(X1,X3,X4),X2))),inference(rw,[status(thm)],[230,133,theory(equality)])).
% cnf(233,plain,(check_cpq(triple(insert_pqp(X1,X2),X3,X4))|~check_cpq(insert_cpq(triple(X1,X3,X4),X2))),inference(cn,[status(thm)],[232,theory(equality)])).
% cnf(489,plain,(less_than(X1,X2)|~pair_in_list(X3,X2,X1)|~check_cpq(insert_cpq(triple(X4,X3,X6),X5))),inference(spm,[status(thm)],[76,233,theory(equality)])).
% cnf(514,negated_conjecture,(less_than(X1,X2)|~pair_in_list(esk4_0,X2,X1)),inference(spm,[status(thm)],[489,183,theory(equality)])).
% cnf(516,negated_conjecture,(less_than(esk2_3(X1,esk4_0,X2),esk1_3(X1,esk4_0,X2))|check_cpq(triple(X1,esk4_0,X2))),inference(spm,[status(thm)],[514,75,theory(equality)])).
% cnf(532,negated_conjecture,(check_cpq(triple(X1,esk4_0,X2))),inference(csr,[status(thm)],[516,74])).
% cnf(535,negated_conjecture,($false),inference(rw,[status(thm)],[184,532,theory(equality)])).
% cnf(536,negated_conjecture,($false),inference(cn,[status(thm)],[535,theory(equality)])).
% cnf(537,negated_conjecture,($false),536,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 168
% # ...of these trivial : 2
% # ...subsumed : 13
% # ...remaining for further processing: 153
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 291
% # ...of the previous two non-trivial : 251
% # Contextual simplify-reflections : 5
% # Paramodulations : 281
% # Factorizations : 8
% # Equation resolutions : 3
% # Current number of processed clauses: 97
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 13
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 189
% # ...number of literals in the above : 701
% # Clause-clause subsumption calls (NU) : 197
% # Rec. Clause-clause subsumption calls : 125
% # Unit Clause-clause subsumption calls : 59
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 113 leaves, 2.17+/-2.323 terms/leaf
% # Paramod-from index: 43 leaves, 1.26+/-0.685 terms/leaf
% # Paramod-into index: 104 leaves, 1.92+/-2.209 terms/leaf
% # -------------------------------------------------
% # User time : 0.035 s
% # System time : 0.002 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP30105/SWV390+1.tptp
%
%------------------------------------------------------------------------------