TSTP Solution File: SWV373+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV373+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:49:08 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP24301/SWV373+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24301/SWV373+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24301/SWV373+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 24397
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 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(12, axiom,![X1]:![X2]:![X3]:![X4]:(~(X2=create_slb)=>findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),file('/tmp/SRASS.s.p', ax51)).
% fof(14, axiom,![X1]:![X2]:![X3]:(ok(findmin_cpq_eff(triple(X1,X2,X3)))=>((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))),file('/tmp/SRASS.s.p', l9_l10)).
% fof(43, conjecture,![X1]:![X2]:![X3]:(~(contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3))))=>~(ok(findmin_cpq_eff(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l9_co)).
% fof(44, negated_conjecture,~(![X1]:![X2]:![X3]:(~(contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3))))=>~(ok(findmin_cpq_eff(triple(X1,X2,X3)))))),inference(assume_negation,[status(cth)],[43])).
% fof(54, negated_conjecture,~(![X1]:![X2]:![X3]:(~(contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3))))=>~(ok(findmin_cpq_eff(triple(X1,X2,X3)))))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(55, 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(56, 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)],[55])).
% cnf(57,plain,(contains_cpq(triple(X1,X2,X3),X4)|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[56])).
% fof(82, plain,![X1]:![X2]:![X3]:![X4]:(X2=create_slb|findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),inference(fof_nnf,[status(thm)],[12])).
% fof(83, plain,![X5]:![X6]:![X7]:![X8]:(X6=create_slb|findmin_cpq_res(triple(X5,X6,X7))=findmin_pqp_res(X5)),inference(variable_rename,[status(thm)],[82])).
% cnf(84,plain,(findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb),inference(split_conjunct,[status(thm)],[83])).
% fof(87, plain,![X1]:![X2]:![X3]:(~(ok(findmin_cpq_eff(triple(X1,X2,X3))))|((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(88, plain,![X4]:![X5]:![X6]:(~(ok(findmin_cpq_eff(triple(X4,X5,X6))))|((~(X5=create_slb)&contains_slb(X5,findmin_pqp_res(X4)))&less_than(lookup_slb(X5,findmin_pqp_res(X4)),findmin_pqp_res(X4)))),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X4]:![X5]:![X6]:(((~(X5=create_slb)|~(ok(findmin_cpq_eff(triple(X4,X5,X6)))))&(contains_slb(X5,findmin_pqp_res(X4))|~(ok(findmin_cpq_eff(triple(X4,X5,X6))))))&(less_than(lookup_slb(X5,findmin_pqp_res(X4)),findmin_pqp_res(X4))|~(ok(findmin_cpq_eff(triple(X4,X5,X6)))))),inference(distribute,[status(thm)],[88])).
% cnf(91,plain,(contains_slb(X2,findmin_pqp_res(X1))|~ok(findmin_cpq_eff(triple(X1,X2,X3)))),inference(split_conjunct,[status(thm)],[89])).
% cnf(92,plain,(~ok(findmin_cpq_eff(triple(X1,X2,X3)))|X2!=create_slb),inference(split_conjunct,[status(thm)],[89])).
% fof(178, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3))))&ok(findmin_cpq_eff(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[54])).
% fof(179, negated_conjecture,?[X4]:?[X5]:?[X6]:(~(contains_cpq(triple(X4,X5,X6),findmin_cpq_res(triple(X4,X5,X6))))&ok(findmin_cpq_eff(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[178])).
% fof(180, negated_conjecture,(~(contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))&ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[179])).
% cnf(181,negated_conjecture,(ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[180])).
% cnf(182,negated_conjecture,(~contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[180])).
% cnf(193,negated_conjecture,(create_slb!=esk2_0),inference(spm,[status(thm)],[92,181,theory(equality)])).
% cnf(199,negated_conjecture,(create_slb=esk2_0|~contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[182,84,theory(equality)])).
% cnf(202,negated_conjecture,(contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[91,181,theory(equality)])).
% cnf(322,negated_conjecture,(~contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_pqp_res(esk1_0))),inference(sr,[status(thm)],[199,193,theory(equality)])).
% cnf(323,negated_conjecture,(~contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[322,57,theory(equality)])).
% cnf(324,negated_conjecture,($false),inference(rw,[status(thm)],[323,202,theory(equality)])).
% cnf(325,negated_conjecture,($false),inference(cn,[status(thm)],[324,theory(equality)])).
% cnf(326,negated_conjecture,($false),325,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 114
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 112
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 117
% # ...of the previous two non-trivial : 105
% # Contextual simplify-reflections : 2
% # Paramodulations : 113
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 97
% # ...number of literals in the above : 311
% # Clause-clause subsumption calls (NU) : 20
% # Rec. Clause-clause subsumption calls : 20
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 77 leaves, 1.77+/-1.467 terms/leaf
% # Paramod-from index: 30 leaves, 1.27+/-0.512 terms/leaf
% # Paramod-into index: 67 leaves, 1.57+/-1.374 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.003 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP24301/SWV373+1.tptp
%
%------------------------------------------------------------------------------