TSTP Solution File: SWV369+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV369+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 08:53:12 EST 2010
% Result : Theorem 1.25s
% Output : Solution 1.25s
% 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/SystemOnTPTP20063/SWV369+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20063/SWV369+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20063/SWV369+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 20195
% 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(1, axiom,![X1]:![X2]:![X3]:![X4]:(contains_cpq(triple(X1,X2,X3),X4)<=>contains_slb(X2,X4)),file('/tmp/SRASS.s.p', ax39)).
% fof(2, axiom,![X1]:![X2]:i(triple(X1,create_slb,X2))=create_pq,file('/tmp/SRASS.s.p', ax54)).
% fof(8, axiom,![X1]:~(contains_slb(create_slb,X1)),file('/tmp/SRASS.s.p', ax20)).
% fof(9, axiom,![X1]:~(contains_pq(create_pq,X1)),file('/tmp/SRASS.s.p', ax8)).
% fof(63, conjecture,![X1]:![X2]:![X3]:(contains_cpq(triple(X1,create_slb,X2),X3)<=>contains_pq(i(triple(X1,create_slb,X2)),X3)),file('/tmp/SRASS.s.p', l5_co)).
% fof(64, negated_conjecture,~(![X1]:![X2]:![X3]:(contains_cpq(triple(X1,create_slb,X2),X3)<=>contains_pq(i(triple(X1,create_slb,X2)),X3))),inference(assume_negation,[status(cth)],[63])).
% fof(65, plain,![X1]:~(contains_slb(create_slb,X1)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(66, plain,![X1]:~(contains_pq(create_pq,X1)),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(76, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_cpq(triple(X1,X2,X3),X4))|contains_slb(X2,X4))&(~(contains_slb(X2,X4))|contains_cpq(triple(X1,X2,X3),X4))),inference(fof_nnf,[status(thm)],[1])).
% fof(77, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_cpq(triple(X5,X6,X7),X8))|contains_slb(X6,X8))&(~(contains_slb(X6,X8))|contains_cpq(triple(X5,X6,X7),X8))),inference(variable_rename,[status(thm)],[76])).
% cnf(79,plain,(contains_slb(X1,X2)|~contains_cpq(triple(X3,X1,X4),X2)),inference(split_conjunct,[status(thm)],[77])).
% fof(80, plain,![X3]:![X4]:i(triple(X3,create_slb,X4))=create_pq,inference(variable_rename,[status(thm)],[2])).
% cnf(81,plain,(i(triple(X1,create_slb,X2))=create_pq),inference(split_conjunct,[status(thm)],[80])).
% fof(93, plain,![X2]:~(contains_slb(create_slb,X2)),inference(variable_rename,[status(thm)],[65])).
% cnf(94,plain,(~contains_slb(create_slb,X1)),inference(split_conjunct,[status(thm)],[93])).
% fof(95, plain,![X2]:~(contains_pq(create_pq,X2)),inference(variable_rename,[status(thm)],[66])).
% cnf(96,plain,(~contains_pq(create_pq,X1)),inference(split_conjunct,[status(thm)],[95])).
% fof(276, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(contains_cpq(triple(X1,create_slb,X2),X3))|~(contains_pq(i(triple(X1,create_slb,X2)),X3)))&(contains_cpq(triple(X1,create_slb,X2),X3)|contains_pq(i(triple(X1,create_slb,X2)),X3))),inference(fof_nnf,[status(thm)],[64])).
% fof(277, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(contains_cpq(triple(X4,create_slb,X5),X6))|~(contains_pq(i(triple(X4,create_slb,X5)),X6)))&(contains_cpq(triple(X4,create_slb,X5),X6)|contains_pq(i(triple(X4,create_slb,X5)),X6))),inference(variable_rename,[status(thm)],[276])).
% fof(278, negated_conjecture,((~(contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0))|~(contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0)))&(contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)|contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0))),inference(skolemize,[status(esa)],[277])).
% cnf(279,negated_conjecture,(contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0)|contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)),inference(split_conjunct,[status(thm)],[278])).
% cnf(282,negated_conjecture,(contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)|contains_pq(create_pq,esk7_0)),inference(rw,[status(thm)],[279,81,theory(equality)])).
% cnf(283,negated_conjecture,(contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)),inference(sr,[status(thm)],[282,96,theory(equality)])).
% cnf(317,negated_conjecture,(contains_slb(create_slb,esk7_0)),inference(spm,[status(thm)],[79,283,theory(equality)])).
% cnf(319,negated_conjecture,($false),inference(sr,[status(thm)],[317,94,theory(equality)])).
% cnf(320,negated_conjecture,($false),319,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 132
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 131
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 27
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 2
% # Paramodulations : 22
% # Factorizations : 2
% # Equation resolutions : 4
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 57
% # ...number of literals in the above : 133
% # Clause-clause subsumption calls (NU) : 75
% # Rec. Clause-clause subsumption calls : 70
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 57 leaves, 1.19+/-0.544 terms/leaf
% # Paramod-from index: 24 leaves, 1.12+/-0.439 terms/leaf
% # Paramod-into index: 49 leaves, 1.16+/-0.548 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.005 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP20063/SWV369+1.tptp
%
%------------------------------------------------------------------------------