TSTP Solution File: SWV374+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV374+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:14 EST 2010
% Result : Theorem 1.20s
% Output : Solution 1.20s
% 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/SystemOnTPTP24560/SWV374+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24560/SWV374+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24560/SWV374+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 24656
% 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(2, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(6, axiom,![X1]:![X2]:findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad),file('/tmp/SRASS.s.p', ax46)).
% fof(8, axiom,![X1]:![X2]:![X3]:![X4]:((~(X2=create_slb)&~(contains_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),file('/tmp/SRASS.s.p', ax47)).
% fof(10, axiom,![X1]:![X2]:![X3]:![X4]:(((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),file('/tmp/SRASS.s.p', ax48)).
% fof(21, axiom,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),file('/tmp/SRASS.s.p', stricly_smaller_definition)).
% fof(28, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(42, conjecture,![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', l10_co)).
% fof(43, negated_conjecture,~(![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(assume_negation,[status(cth)],[42])).
% fof(45, plain,![X1]:![X2]:![X3]:![X4]:((~(X2=create_slb)&~(contains_slb(X2,findmin_pqp_res(X1))))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(48, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(51, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(56, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[2])).
% cnf(57,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(65, plain,![X3]:![X4]:findmin_cpq_eff(triple(X3,create_slb,X4))=triple(X3,create_slb,bad),inference(variable_rename,[status(thm)],[6])).
% cnf(66,plain,(findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad)),inference(split_conjunct,[status(thm)],[65])).
% fof(70, plain,![X1]:![X2]:![X3]:![X4]:((X2=create_slb|contains_slb(X2,findmin_pqp_res(X1)))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_nnf,[status(thm)],[45])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:((X6=create_slb|contains_slb(X6,findmin_pqp_res(X5)))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad)),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|contains_slb(X2,findmin_pqp_res(X1))|X2=create_slb),inference(split_conjunct,[status(thm)],[71])).
% fof(76, plain,![X1]:![X2]:![X3]:![X4]:(((X2=create_slb|~(contains_slb(X2,findmin_pqp_res(X1))))|~(strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)),inference(fof_nnf,[status(thm)],[10])).
% fof(77, plain,![X5]:![X6]:![X7]:![X8]:(((X6=create_slb|~(contains_slb(X6,findmin_pqp_res(X5))))|~(strictly_less_than(findmin_pqp_res(X5),lookup_slb(X6,findmin_pqp_res(X5)))))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad)),inference(variable_rename,[status(thm)],[76])).
% cnf(78,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)|X2=create_slb|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))|~contains_slb(X2,findmin_pqp_res(X1))),inference(split_conjunct,[status(thm)],[77])).
% fof(105, plain,![X1]:![X2]:((~(strictly_less_than(X1,X2))|(less_than(X1,X2)&~(less_than(X2,X1))))&((~(less_than(X1,X2))|less_than(X2,X1))|strictly_less_than(X1,X2))),inference(fof_nnf,[status(thm)],[48])).
% fof(106, plain,![X3]:![X4]:((~(strictly_less_than(X3,X4))|(less_than(X3,X4)&~(less_than(X4,X3))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(variable_rename,[status(thm)],[105])).
% fof(107, plain,![X3]:![X4]:(((less_than(X3,X4)|~(strictly_less_than(X3,X4)))&(~(less_than(X4,X3))|~(strictly_less_than(X3,X4))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(distribute,[status(thm)],[106])).
% cnf(108,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[107])).
% fof(130, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[51])).
% cnf(131,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[130])).
% fof(170, negated_conjecture,?[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)],[43])).
% fof(171, negated_conjecture,?[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)],[170])).
% fof(172, negated_conjecture,(ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))&((esk2_0=create_slb|~(contains_slb(esk2_0,findmin_pqp_res(esk1_0))))|~(less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))))),inference(skolemize,[status(esa)],[171])).
% cnf(173,negated_conjecture,(esk2_0=create_slb|~less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))|~contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(split_conjunct,[status(thm)],[172])).
% cnf(174,negated_conjecture,(ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[172])).
% cnf(176,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[108,57])).
% cnf(180,plain,(triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|~strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))),inference(csr,[status(thm)],[78,72])).
% cnf(217,plain,(create_slb=X2|contains_slb(X2,findmin_pqp_res(X1))|~ok(findmin_cpq_eff(triple(X1,X2,X3)))),inference(spm,[status(thm)],[131,72,theory(equality)])).
% cnf(289,plain,(triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)=findmin_cpq_eff(triple(X1,X2,X3))|create_slb=X2|less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))),inference(spm,[status(thm)],[180,176,theory(equality)])).
% cnf(314,negated_conjecture,(create_slb=esk2_0|contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[217,174,theory(equality)])).
% cnf(3327,plain,(create_slb=X2|less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))|~ok(findmin_cpq_eff(triple(X1,X2,X3)))),inference(spm,[status(thm)],[131,289,theory(equality)])).
% cnf(3406,negated_conjecture,(create_slb=esk2_0|less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[3327,174,theory(equality)])).
% cnf(3424,negated_conjecture,(esk2_0=create_slb|~contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[173,3406,theory(equality)])).
% cnf(3430,negated_conjecture,(esk2_0=create_slb),inference(csr,[status(thm)],[3424,314])).
% cnf(3493,negated_conjecture,(ok(triple(esk1_0,create_slb,bad))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[174,3430,theory(equality)]),66,theory(equality)])).
% cnf(3494,negated_conjecture,($false),inference(sr,[status(thm)],[3493,131,theory(equality)])).
% cnf(3495,negated_conjecture,($false),3494,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 530
% # ...of these trivial : 1
% # ...subsumed : 289
% # ...remaining for further processing: 240
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 34
% # Generated clauses : 2717
% # ...of the previous two non-trivial : 2524
% # Contextual simplify-reflections : 228
% # Paramodulations : 2589
% # Factorizations : 126
% # Equation resolutions : 3
% # Current number of processed clauses: 153
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 126
% # Current number of unprocessed clauses: 1564
% # ...number of literals in the above : 7978
% # Clause-clause subsumption calls (NU) : 9525
% # Rec. Clause-clause subsumption calls : 7313
% # Unit Clause-clause subsumption calls : 32
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 164 leaves, 2.46+/-2.704 terms/leaf
% # Paramod-from index: 69 leaves, 1.48+/-1.490 terms/leaf
% # Paramod-into index: 142 leaves, 2.13+/-2.349 terms/leaf
% # -------------------------------------------------
% # User time : 0.195 s
% # System time : 0.005 s
% # Total time : 0.200 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.36 CPU 0.44 WC
% FINAL PrfWatch: 0.36 CPU 0.44 WC
% SZS output end Solution for /tmp/SystemOnTPTP24560/SWV374+1.tptp
%
%------------------------------------------------------------------------------