TSTP Solution File: SWV381+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV381+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 : art09.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:30 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP21728/SWV381+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21728/SWV381+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21728/SWV381+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 21824
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 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)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>~(phi(findmin_cpq_eff(triple(X1,X2,X3))))),file('/tmp/SRASS.s.p', l17_l18)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:(contains_cpq(triple(X1,X2,X3),X4)<=>contains_pq(i(triple(X1,X2,X3)),X4)),file('/tmp/SRASS.s.p', l17_li56)).
% fof(7, axiom,![X1]:![X2]:findmin_cpq_res(triple(X1,create_slb,X2))=bottom,file('/tmp/SRASS.s.p', ax50)).
% fof(8, 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(9, axiom,![X1]:![X2]:i(triple(X1,create_slb,X2))=create_pq,file('/tmp/SRASS.s.p', ax54)).
% fof(12, axiom,![X1]:![X2]:(issmallestelement_pq(X1,X2)<=>![X3]:(contains_pq(X1,X3)=>less_than(X2,X3))),file('/tmp/SRASS.s.p', ax10)).
% fof(20, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(42, 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(50, axiom,![X1]:~(contains_pq(create_pq,X1)),file('/tmp/SRASS.s.p', ax8)).
% fof(65, conjecture,![X1]:![X2]:![X3]:(phi(findmin_cpq_eff(triple(X1,X2,X3)))=>issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))),file('/tmp/SRASS.s.p', l17_co)).
% fof(66, negated_conjecture,~(![X1]:![X2]:![X3]:(phi(findmin_cpq_eff(triple(X1,X2,X3)))=>issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))))),inference(assume_negation,[status(cth)],[65])).
% fof(67, plain,![X1]:![X2]:![X3]:(?[X4]:(contains_cpq(triple(X1,X2,X3),X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>~(phi(findmin_cpq_eff(triple(X1,X2,X3))))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(71, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[42,theory(equality)])).
% fof(74, plain,![X1]:~(contains_pq(create_pq,X1)),inference(fof_simplification,[status(thm)],[50,theory(equality)])).
% fof(79, plain,![X1]:![X2]:![X3]:(![X4]:(~(contains_cpq(triple(X1,X2,X3),X4))|~(strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))))|~(phi(findmin_cpq_eff(triple(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[67])).
% fof(80, plain,![X5]:![X6]:![X7]:(![X8]:(~(contains_cpq(triple(X5,X6,X7),X8))|~(strictly_less_than(X8,findmin_cpq_res(triple(X5,X6,X7)))))|~(phi(findmin_cpq_eff(triple(X5,X6,X7))))),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_cpq(triple(X5,X6,X7),X8))|~(strictly_less_than(X8,findmin_cpq_res(triple(X5,X6,X7)))))|~(phi(findmin_cpq_eff(triple(X5,X6,X7))))),inference(shift_quantors,[status(thm)],[80])).
% cnf(82,plain,(~phi(findmin_cpq_eff(triple(X1,X2,X3)))|~strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))|~contains_cpq(triple(X1,X2,X3),X4)),inference(split_conjunct,[status(thm)],[81])).
% fof(88, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_cpq(triple(X1,X2,X3),X4))|contains_pq(i(triple(X1,X2,X3)),X4))&(~(contains_pq(i(triple(X1,X2,X3)),X4))|contains_cpq(triple(X1,X2,X3),X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(89, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_cpq(triple(X5,X6,X7),X8))|contains_pq(i(triple(X5,X6,X7)),X8))&(~(contains_pq(i(triple(X5,X6,X7)),X8))|contains_cpq(triple(X5,X6,X7),X8))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(contains_cpq(triple(X1,X2,X3),X4)|~contains_pq(i(triple(X1,X2,X3)),X4)),inference(split_conjunct,[status(thm)],[89])).
% fof(96, plain,![X3]:![X4]:findmin_cpq_res(triple(X3,create_slb,X4))=bottom,inference(variable_rename,[status(thm)],[7])).
% cnf(97,plain,(findmin_cpq_res(triple(X1,create_slb,X2))=bottom),inference(split_conjunct,[status(thm)],[96])).
% fof(98, plain,![X1]:![X2]:![X3]:![X4]:(X2=create_slb|findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(99, plain,![X5]:![X6]:![X7]:![X8]:(X6=create_slb|findmin_cpq_res(triple(X5,X6,X7))=findmin_pqp_res(X5)),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb),inference(split_conjunct,[status(thm)],[99])).
% fof(101, plain,![X3]:![X4]:i(triple(X3,create_slb,X4))=create_pq,inference(variable_rename,[status(thm)],[9])).
% cnf(102,plain,(i(triple(X1,create_slb,X2))=create_pq),inference(split_conjunct,[status(thm)],[101])).
% fof(111, plain,![X1]:![X2]:((~(issmallestelement_pq(X1,X2))|![X3]:(~(contains_pq(X1,X3))|less_than(X2,X3)))&(?[X3]:(contains_pq(X1,X3)&~(less_than(X2,X3)))|issmallestelement_pq(X1,X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(112, plain,![X4]:![X5]:((~(issmallestelement_pq(X4,X5))|![X6]:(~(contains_pq(X4,X6))|less_than(X5,X6)))&(?[X7]:(contains_pq(X4,X7)&~(less_than(X5,X7)))|issmallestelement_pq(X4,X5))),inference(variable_rename,[status(thm)],[111])).
% fof(113, plain,![X4]:![X5]:((~(issmallestelement_pq(X4,X5))|![X6]:(~(contains_pq(X4,X6))|less_than(X5,X6)))&((contains_pq(X4,esk1_2(X4,X5))&~(less_than(X5,esk1_2(X4,X5))))|issmallestelement_pq(X4,X5))),inference(skolemize,[status(esa)],[112])).
% fof(114, plain,![X4]:![X5]:![X6]:(((~(contains_pq(X4,X6))|less_than(X5,X6))|~(issmallestelement_pq(X4,X5)))&((contains_pq(X4,esk1_2(X4,X5))&~(less_than(X5,esk1_2(X4,X5))))|issmallestelement_pq(X4,X5))),inference(shift_quantors,[status(thm)],[113])).
% fof(115, plain,![X4]:![X5]:![X6]:(((~(contains_pq(X4,X6))|less_than(X5,X6))|~(issmallestelement_pq(X4,X5)))&((contains_pq(X4,esk1_2(X4,X5))|issmallestelement_pq(X4,X5))&(~(less_than(X5,esk1_2(X4,X5)))|issmallestelement_pq(X4,X5)))),inference(distribute,[status(thm)],[114])).
% cnf(116,plain,(issmallestelement_pq(X1,X2)|~less_than(X2,esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[115])).
% cnf(117,plain,(issmallestelement_pq(X1,X2)|contains_pq(X1,esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[115])).
% fof(144, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[20])).
% cnf(145,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[144])).
% fof(216, 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)],[71])).
% fof(217, 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)],[216])).
% fof(218, 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)],[217])).
% cnf(219,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[218])).
% fof(245, plain,![X2]:~(contains_pq(create_pq,X2)),inference(variable_rename,[status(thm)],[74])).
% cnf(246,plain,(~contains_pq(create_pq,X1)),inference(split_conjunct,[status(thm)],[245])).
% fof(287, negated_conjecture,?[X1]:?[X2]:?[X3]:(phi(findmin_cpq_eff(triple(X1,X2,X3)))&~(issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[66])).
% fof(288, negated_conjecture,?[X4]:?[X5]:?[X6]:(phi(findmin_cpq_eff(triple(X4,X5,X6)))&~(issmallestelement_pq(i(triple(X4,X5,X6)),findmin_cpq_res(triple(X4,X5,X6))))),inference(variable_rename,[status(thm)],[287])).
% fof(289, negated_conjecture,(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))&~(issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))))),inference(skolemize,[status(esa)],[288])).
% cnf(290,negated_conjecture,(~issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[289])).
% cnf(291,negated_conjecture,(phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[289])).
% cnf(294,plain,(less_than(X2,X1)|strictly_less_than(X1,X2)),inference(csr,[status(thm)],[219,145])).
% cnf(328,plain,(issmallestelement_pq(create_pq,X1)),inference(spm,[status(thm)],[246,117,theory(equality)])).
% cnf(357,negated_conjecture,(create_slb=esk6_0|~issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_pqp_res(esk5_0))),inference(spm,[status(thm)],[290,100,theory(equality)])).
% cnf(421,plain,(less_than(findmin_cpq_res(triple(X1,X2,X3)),X4)|~phi(findmin_cpq_eff(triple(X1,X2,X3)))|~contains_cpq(triple(X1,X2,X3),X4)),inference(spm,[status(thm)],[82,294,theory(equality)])).
% cnf(729,negated_conjecture,(less_than(findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)),X1)|~contains_cpq(triple(esk5_0,esk6_0,esk7_0),X1)),inference(spm,[status(thm)],[421,291,theory(equality)])).
% cnf(735,negated_conjecture,(less_than(findmin_pqp_res(esk5_0),X1)|create_slb=esk6_0|~contains_cpq(triple(esk5_0,esk6_0,esk7_0),X1)),inference(spm,[status(thm)],[729,100,theory(equality)])).
% cnf(737,negated_conjecture,(esk6_0=create_slb|less_than(findmin_pqp_res(esk5_0),X1)|~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),X1)),inference(spm,[status(thm)],[735,90,theory(equality)])).
% cnf(768,negated_conjecture,(esk6_0=create_slb|less_than(findmin_pqp_res(esk5_0),esk1_2(i(triple(esk5_0,esk6_0,esk7_0)),X1))|issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),X1)),inference(spm,[status(thm)],[737,117,theory(equality)])).
% cnf(776,negated_conjecture,(issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_pqp_res(esk5_0))|esk6_0=create_slb),inference(spm,[status(thm)],[116,768,theory(equality)])).
% cnf(777,negated_conjecture,(esk6_0=create_slb),inference(csr,[status(thm)],[776,357])).
% cnf(803,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[290,777,theory(equality)]),102,theory(equality)]),777,theory(equality)]),97,theory(equality)]),328,theory(equality)])).
% cnf(804,negated_conjecture,($false),inference(cn,[status(thm)],[803,theory(equality)])).
% cnf(805,negated_conjecture,($false),804,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 284
% # ...of these trivial : 1
% # ...subsumed : 31
% # ...remaining for further processing: 252
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 15
% # Generated clauses : 413
% # ...of the previous two non-trivial : 362
% # Contextual simplify-reflections : 6
% # Paramodulations : 402
% # Factorizations : 8
% # Equation resolutions : 4
% # Current number of processed clauses: 143
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 14
% # Non-unit-clauses : 105
% # Current number of unprocessed clauses: 235
% # ...number of literals in the above : 772
% # Clause-clause subsumption calls (NU) : 657
% # Rec. Clause-clause subsumption calls : 619
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 155 leaves, 1.74+/-1.400 terms/leaf
% # Paramod-from index: 68 leaves, 1.19+/-0.575 terms/leaf
% # Paramod-into index: 134 leaves, 1.53+/-1.220 terms/leaf
% # -------------------------------------------------
% # User time : 0.047 s
% # System time : 0.003 s
% # Total time : 0.050 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.46 WC
% FINAL PrfWatch: 0.15 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP21728/SWV381+1.tptp
%
%------------------------------------------------------------------------------