TSTP Solution File: SWV411+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV411+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 : art03.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:12 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP32000/SWV411+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP32000/SWV411+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32000/SWV411+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 32096
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:(pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)<=>(pair_in_list(X1,X3,X5)|(X2=X3&X4=X5))),file('/tmp/SRASS.s.p', ax23)).
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:(contains_slb(insert_slb(X1,pair(X2,X4)),X3)<=>(contains_slb(X1,X3)|X2=X3)),file('/tmp/SRASS.s.p', ax21)).
% fof(19, conjecture,![X1]:(![X2]:(contains_slb(X1,X2)=>?[X3]:pair_in_list(X1,X2,X3))=>![X4]:![X5]:![X6]:(contains_slb(insert_slb(X1,pair(X5,X6)),X4)=>?[X7]:pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7))),file('/tmp/SRASS.s.p', l47_co)).
% fof(20, negated_conjecture,~(![X1]:(![X2]:(contains_slb(X1,X2)=>?[X3]:pair_in_list(X1,X2,X3))=>![X4]:![X5]:![X6]:(contains_slb(insert_slb(X1,pair(X5,X6)),X4)=>?[X7]:pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7)))),inference(assume_negation,[status(cth)],[19])).
% fof(25, plain,![X1]:![X2]:![X3]:![X4]:![X5]:((~(pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5))|(pair_in_list(X1,X3,X5)|(X2=X3&X4=X5)))&((~(pair_in_list(X1,X3,X5))&(~(X2=X3)|~(X4=X5)))|pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5))),inference(fof_nnf,[status(thm)],[1])).
% fof(26, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))|(pair_in_list(X6,X8,X10)|(X7=X8&X9=X10)))&((~(pair_in_list(X6,X8,X10))&(~(X7=X8)|~(X9=X10)))|pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((X7=X8|pair_in_list(X6,X8,X10))|~(pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10)))&((X9=X10|pair_in_list(X6,X8,X10))|~(pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))))&((~(pair_in_list(X6,X8,X10))|pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10))&((~(X7=X8)|~(X9=X10))|pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10)))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|X3!=X5|X2!=X4),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)|~pair_in_list(X1,X4,X5)),inference(split_conjunct,[status(thm)],[27])).
% fof(32, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(insert_slb(X1,pair(X2,X4)),X3))|(contains_slb(X1,X3)|X2=X3))&((~(contains_slb(X1,X3))&~(X2=X3))|contains_slb(insert_slb(X1,pair(X2,X4)),X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(insert_slb(X5,pair(X6,X8)),X7))|(contains_slb(X5,X7)|X6=X7))&((~(contains_slb(X5,X7))&~(X6=X7))|contains_slb(insert_slb(X5,pair(X6,X8)),X7))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(insert_slb(X5,pair(X6,X8)),X7))|(contains_slb(X5,X7)|X6=X7))&((~(contains_slb(X5,X7))|contains_slb(insert_slb(X5,pair(X6,X8)),X7))&(~(X6=X7)|contains_slb(insert_slb(X5,pair(X6,X8)),X7)))),inference(distribute,[status(thm)],[33])).
% cnf(37,plain,(X1=X2|contains_slb(X3,X2)|~contains_slb(insert_slb(X3,pair(X1,X4)),X2)),inference(split_conjunct,[status(thm)],[34])).
% fof(78, negated_conjecture,?[X1]:(![X2]:(~(contains_slb(X1,X2))|?[X3]:pair_in_list(X1,X2,X3))&?[X4]:?[X5]:?[X6]:(contains_slb(insert_slb(X1,pair(X5,X6)),X4)&![X7]:~(pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7)))),inference(fof_nnf,[status(thm)],[20])).
% fof(79, negated_conjecture,?[X8]:(![X9]:(~(contains_slb(X8,X9))|?[X10]:pair_in_list(X8,X9,X10))&?[X11]:?[X12]:?[X13]:(contains_slb(insert_slb(X8,pair(X12,X13)),X11)&![X14]:~(pair_in_list(insert_slb(X8,pair(X12,X13)),X11,X14)))),inference(variable_rename,[status(thm)],[78])).
% fof(80, negated_conjecture,(![X9]:(~(contains_slb(esk1_0,X9))|pair_in_list(esk1_0,X9,esk2_1(X9)))&(contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)&![X14]:~(pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X14)))),inference(skolemize,[status(esa)],[79])).
% fof(81, negated_conjecture,![X9]:![X14]:((~(pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X14))&contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0))&(~(contains_slb(esk1_0,X9))|pair_in_list(esk1_0,X9,esk2_1(X9)))),inference(shift_quantors,[status(thm)],[80])).
% cnf(82,negated_conjecture,(pair_in_list(esk1_0,X1,esk2_1(X1))|~contains_slb(esk1_0,X1)),inference(split_conjunct,[status(thm)],[81])).
% cnf(83,negated_conjecture,(contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(84,negated_conjecture,(~pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1)),inference(split_conjunct,[status(thm)],[81])).
% cnf(98,negated_conjecture,(esk4_0=esk3_0|contains_slb(esk1_0,esk3_0)),inference(spm,[status(thm)],[37,83,theory(equality)])).
% cnf(105,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X3)|X2!=X4),inference(er,[status(thm)],[28,theory(equality)])).
% cnf(106,plain,(pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3)),inference(er,[status(thm)],[105,theory(equality)])).
% cnf(111,negated_conjecture,(pair_in_list(esk1_0,esk3_0,esk2_1(esk3_0))|esk3_0=esk4_0),inference(spm,[status(thm)],[82,98,theory(equality)])).
% cnf(112,negated_conjecture,(pair_in_list(insert_slb(esk1_0,pair(X1,X2)),esk3_0,esk2_1(esk3_0))|esk3_0=esk4_0),inference(spm,[status(thm)],[29,111,theory(equality)])).
% cnf(175,negated_conjecture,(esk3_0=esk4_0),inference(spm,[status(thm)],[84,112,theory(equality)])).
% cnf(182,negated_conjecture,(~pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk4_0,X1)),inference(rw,[status(thm)],[84,175,theory(equality)])).
% cnf(186,negated_conjecture,($false),inference(spm,[status(thm)],[182,106,theory(equality)])).
% cnf(187,negated_conjecture,($false),186,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 50
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 70
% # ...of the previous two non-trivial : 51
% # Contextual simplify-reflections : 2
% # Paramodulations : 60
% # Factorizations : 8
% # Equation resolutions : 3
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 56
% # Clause-clause subsumption calls (NU) : 120
% # Rec. Clause-clause subsumption calls : 115
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 39 leaves, 1.77+/-1.544 terms/leaf
% # Paramod-from index: 12 leaves, 1.33+/-1.106 terms/leaf
% # Paramod-into index: 29 leaves, 1.59+/-1.474 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.005 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP32000/SWV411+1.tptp
%
%------------------------------------------------------------------------------