TSTP Solution File: CSR030+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR030+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 : Sat Dec 25 06:04:37 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 21 ~; 17 |; 3 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 3 sgn 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(27,axiom,
! [X6,X5] :
( tptptypes_6_388(X6,X5)
=> tptptypes_5_387(X6,X5) ),
file('/tmp/tmpqwbH6W/sel_CSR030+1.p_1',just7) ).
fof(31,axiom,
! [X6,X5] :
( tptptypes_7_389(X6,X5)
=> tptptypes_6_388(X5,X6) ),
file('/tmp/tmpqwbH6W/sel_CSR030+1.p_1',just9) ).
fof(33,conjecture,
? [X5] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X5,c_pushingwithopenhand) ),
file('/tmp/tmpqwbH6W/sel_CSR030+1.p_1',query30) ).
fof(37,axiom,
( mtvisible(c_tptp_spindleheadmt)
=> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
file('/tmp/tmpqwbH6W/sel_CSR030+1.p_1',just12) ).
fof(38,axiom,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/tmp/tmpqwbH6W/sel_CSR030+1.p_1',just11) ).
fof(57,axiom,
! [X15,X16] :
( ( mtvisible(X15)
& genlmt(X15,X16) )
=> mtvisible(X16) ),
file('/tmp/tmpqwbH6W/sel_CSR030+1.p_1',just49) ).
fof(59,negated_conjecture,
~ ? [X5] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X5,c_pushingwithopenhand) ),
inference(assume_negation,[status(cth)],[33]) ).
fof(128,plain,
! [X6,X5] :
( ~ tptptypes_6_388(X6,X5)
| tptptypes_5_387(X6,X5) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(129,plain,
! [X7,X8] :
( ~ tptptypes_6_388(X7,X8)
| tptptypes_5_387(X7,X8) ),
inference(variable_rename,[status(thm)],[128]) ).
cnf(130,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[129]) ).
fof(134,plain,
! [X6,X5] :
( ~ tptptypes_7_389(X6,X5)
| tptptypes_6_388(X5,X6) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(135,plain,
! [X7,X8] :
( ~ tptptypes_7_389(X7,X8)
| tptptypes_6_388(X8,X7) ),
inference(variable_rename,[status(thm)],[134]) ).
cnf(136,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
inference(split_conjunct,[status(thm)],[135]) ).
fof(138,negated_conjecture,
! [X5] :
( mtvisible(c_tptp_member3393_mt)
& ~ tptptypes_5_387(X5,c_pushingwithopenhand) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(139,negated_conjecture,
! [X6] :
( mtvisible(c_tptp_member3393_mt)
& ~ tptptypes_5_387(X6,c_pushingwithopenhand) ),
inference(variable_rename,[status(thm)],[138]) ).
cnf(140,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
inference(split_conjunct,[status(thm)],[139]) ).
cnf(141,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
inference(split_conjunct,[status(thm)],[139]) ).
fof(151,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
inference(fof_nnf,[status(thm)],[37]) ).
cnf(152,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(153,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[38]) ).
fof(206,plain,
! [X15,X16] :
( ~ mtvisible(X15)
| ~ genlmt(X15,X16)
| mtvisible(X16) ),
inference(fof_nnf,[status(thm)],[57]) ).
fof(207,plain,
! [X17,X18] :
( ~ mtvisible(X17)
| ~ genlmt(X17,X18)
| mtvisible(X18) ),
inference(variable_rename,[status(thm)],[206]) ).
cnf(208,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[207]) ).
cnf(212,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[140,130,theory(equality)]) ).
cnf(215,plain,
( mtvisible(c_tptp_spindleheadmt)
| ~ mtvisible(c_tptp_member3393_mt) ),
inference(spm,[status(thm)],[208,153,theory(equality)]) ).
cnf(221,plain,
( mtvisible(c_tptp_spindleheadmt)
| $false ),
inference(rw,[status(thm)],[215,141,theory(equality)]) ).
cnf(222,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[221,theory(equality)]) ).
cnf(261,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| $false ),
inference(rw,[status(thm)],[152,222,theory(equality)]) ).
cnf(262,plain,
tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451),
inference(cn,[status(thm)],[261,theory(equality)]) ).
cnf(266,negated_conjecture,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[212,136,theory(equality)]) ).
cnf(267,plain,
$false,
inference(sr,[status(thm)],[262,266,theory(equality)]) ).
cnf(268,plain,
$false,
267,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR030+1.p
% --creating new selector for [CSR002+0.ax]
% -running prover on /tmp/tmpqwbH6W/sel_CSR030+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR030+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR030+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR030+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------