TSTP Solution File: SWV379+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV379+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 : art06.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:50:04 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP18763/SWV379+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18763/SWV379+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18763/SWV379+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 18859
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),file('/tmp/SRASS.s.p', ax41)).
% fof(4, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(5, axiom,![X1]:![X2]:findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad),file('/tmp/SRASS.s.p', ax46)).
% fof(7, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(11, 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(19, 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(25, axiom,![X1]:![X2]:![X3]:![X4]:(((~(X2=create_slb)&contains_slb(X2,findmin_pqp_res(X1)))&less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)))=>findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)),file('/tmp/SRASS.s.p', ax49)).
% fof(28, 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(42, conjecture,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(findmin_cpq_eff(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l15_co)).
% fof(43, negated_conjecture,~(![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(findmin_cpq_eff(triple(X1,X2,X3)))))),inference(assume_negation,[status(cth)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(45, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(46, 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)],[11,theory(equality)])).
% fof(51, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(53, negated_conjecture,~(![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>~(ok(findmin_cpq_eff(triple(X1,X2,X3)))))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(54, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|X3=bad),inference(fof_nnf,[status(thm)],[44])).
% fof(55, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|X6=bad),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(X1=bad|ok(triple(X2,X3,X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(62, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[45])).
% cnf(63,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X3]:![X4]:findmin_cpq_eff(triple(X3,create_slb,X4))=triple(X3,create_slb,bad),inference(variable_rename,[status(thm)],[5])).
% cnf(65,plain,(findmin_cpq_eff(triple(X1,create_slb,X2))=triple(X1,create_slb,bad)),inference(split_conjunct,[status(thm)],[64])).
% fof(69, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(70,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(77, 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)],[46])).
% fof(78, 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)],[77])).
% cnf(79,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)],[78])).
% fof(99, 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)],[19])).
% fof(100, 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)],[99])).
% cnf(101,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)],[100])).
% fof(114, plain,![X1]:![X2]:![X3]:![X4]:(((X2=create_slb|~(contains_slb(X2,findmin_pqp_res(X1))))|~(less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))))|findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)),inference(fof_nnf,[status(thm)],[25])).
% fof(115, plain,![X5]:![X6]:![X7]:![X8]:(((X6=create_slb|~(contains_slb(X6,findmin_pqp_res(X5))))|~(less_than(lookup_slb(X6,findmin_pqp_res(X5)),findmin_pqp_res(X5))))|findmin_cpq_eff(triple(X5,X6,X7))=triple(X5,update_slb(X6,findmin_pqp_res(X5)),X7)),inference(variable_rename,[status(thm)],[114])).
% cnf(116,plain,(findmin_cpq_eff(triple(X1,X2,X3))=triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)|X2=create_slb|~less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))|~contains_slb(X2,findmin_pqp_res(X1))),inference(split_conjunct,[status(thm)],[115])).
% fof(123, 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)],[51])).
% fof(124, 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)],[123])).
% fof(125, 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)],[124])).
% cnf(126,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[125])).
% fof(171, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(ok(triple(X1,X2,X3)))&ok(findmin_cpq_eff(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[53])).
% fof(172, negated_conjecture,?[X4]:?[X5]:?[X6]:(~(ok(triple(X4,X5,X6)))&ok(findmin_cpq_eff(triple(X4,X5,X6)))),inference(variable_rename,[status(thm)],[171])).
% fof(173, negated_conjecture,(~(ok(triple(esk1_0,esk2_0,esk3_0)))&ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[172])).
% cnf(174,negated_conjecture,(ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))),inference(split_conjunct,[status(thm)],[173])).
% cnf(175,negated_conjecture,(~ok(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[173])).
% cnf(177,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[126,70])).
% cnf(181,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)],[101,79])).
% cnf(182,negated_conjecture,(bad=esk3_0),inference(spm,[status(thm)],[175,56,theory(equality)])).
% cnf(221,plain,(create_slb=X2|contains_slb(X2,findmin_pqp_res(X1))|~ok(findmin_cpq_eff(triple(X1,X2,X3)))),inference(spm,[status(thm)],[63,79,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)],[181,177,theory(equality)])).
% cnf(290,negated_conjecture,(ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))),inference(rw,[status(thm)],[174,182,theory(equality)])).
% cnf(312,negated_conjecture,(create_slb=esk2_0|contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[221,290,theory(equality)])).
% cnf(1008,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)],[63,289,theory(equality)])).
% cnf(1076,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)],[1008,290,theory(equality)])).
% cnf(1081,negated_conjecture,(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1)=findmin_cpq_eff(triple(esk1_0,esk2_0,X1))|create_slb=esk2_0|~contains_slb(esk2_0,findmin_pqp_res(esk1_0))),inference(spm,[status(thm)],[116,1076,theory(equality)])).
% cnf(1231,negated_conjecture,(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1)=findmin_cpq_eff(triple(esk1_0,esk2_0,X1))|esk2_0=create_slb),inference(csr,[status(thm)],[1081,312])).
% cnf(1248,negated_conjecture,(esk2_0=create_slb|~ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))),inference(spm,[status(thm)],[63,1231,theory(equality)])).
% cnf(1297,negated_conjecture,(esk2_0=create_slb|$false),inference(rw,[status(thm)],[1248,290,theory(equality)])).
% cnf(1298,negated_conjecture,(esk2_0=create_slb),inference(cn,[status(thm)],[1297,theory(equality)])).
% cnf(1312,negated_conjecture,(ok(triple(esk1_0,create_slb,bad))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[290,1298,theory(equality)]),65,theory(equality)])).
% cnf(1313,negated_conjecture,($false),inference(sr,[status(thm)],[1312,63,theory(equality)])).
% cnf(1314,negated_conjecture,($false),1313,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 273
% # ...of these trivial : 1
% # ...subsumed : 87
% # ...remaining for further processing: 185
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 9
% # Generated clauses : 985
% # ...of the previous two non-trivial : 904
% # Contextual simplify-reflections : 30
% # Paramodulations : 939
% # Factorizations : 44
% # Equation resolutions : 3
% # Current number of processed clauses: 124
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 94
% # Current number of unprocessed clauses: 632
% # ...number of literals in the above : 2966
% # Clause-clause subsumption calls (NU) : 1250
% # Rec. Clause-clause subsumption calls : 913
% # Unit Clause-clause subsumption calls : 59
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 130 leaves, 2.28+/-2.551 terms/leaf
% # Paramod-from index: 58 leaves, 1.31+/-1.221 terms/leaf
% # Paramod-into index: 116 leaves, 2.06+/-2.433 terms/leaf
% # -------------------------------------------------
% # User time : 0.068 s
% # System time : 0.004 s
% # Total time : 0.072 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP18763/SWV379+1.tptp
%
%------------------------------------------------------------------------------