%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR026+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:01:36 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 18 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 25 ~; 25 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',query26) ).
fof(27,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',just7) ).
fof(28,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',just6) ).
fof(29,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',just5) ).
fof(31,axiom,
! [X4] :
( ( mtvisible(c_tptp_member2701_mt)
& runningshorts(X4) )
=> tptpofobject(X4,f_tptpquantityfn_2(n_756)) ),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',just9) ).
fof(32,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',just8) ).
fof(37,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',just11) ).
fof(55,axiom,
! [X16,X17] :
( ( mtvisible(X16)
& genlmt(X16,X17) )
=> mtvisible(X17) ),
file('/tmp/tmp0_QqwS/sel_CSR026+1.p_1',just48) ).
fof(58,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(69,negated_conjecture,
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(fof_nnf,[status(thm)],[58]) ).
cnf(70,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(71,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(127,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(128,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(129,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[29]) ).
fof(131,plain,
! [X4] :
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X4)
| tptpofobject(X4,f_tptpquantityfn_2(n_756)) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(132,plain,
! [X5] :
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X5)
| tptpofobject(X5,f_tptpquantityfn_2(n_756)) ),
inference(variable_rename,[status(thm)],[131]) ).
cnf(133,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(split_conjunct,[status(thm)],[132]) ).
cnf(134,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(split_conjunct,[status(thm)],[32]) ).
fof(147,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(fof_nnf,[status(thm)],[37]) ).
cnf(148,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[147]) ).
fof(196,plain,
! [X16,X17] :
( ~ mtvisible(X16)
| ~ genlmt(X16,X17)
| mtvisible(X17) ),
inference(fof_nnf,[status(thm)],[55]) ).
fof(197,plain,
! [X18,X19] :
( ~ mtvisible(X18)
| ~ genlmt(X18,X19)
| mtvisible(X19) ),
inference(variable_rename,[status(thm)],[196]) ).
cnf(198,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[197]) ).
cnf(206,plain,
( mtvisible(c_tptp_member3993_mt)
| ~ mtvisible(c_tptp_spindlecollectormt) ),
inference(spm,[status(thm)],[198,134,theory(equality)]) ).
cnf(207,plain,
( mtvisible(c_tptp_member2701_mt)
| ~ mtvisible(c_tptp_spindlecollectormt) ),
inference(spm,[status(thm)],[198,128,theory(equality)]) ).
cnf(211,plain,
( mtvisible(c_tptp_spindleheadmt)
| ~ mtvisible(c_tptp_member3993_mt) ),
inference(spm,[status(thm)],[198,127,theory(equality)]) ).
cnf(212,plain,
( mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[198,129,theory(equality)]) ).
cnf(213,plain,
( mtvisible(c_tptp_member3993_mt)
| $false ),
inference(rw,[status(thm)],[206,71,theory(equality)]) ).
cnf(214,plain,
mtvisible(c_tptp_member3993_mt),
inference(cn,[status(thm)],[213,theory(equality)]) ).
cnf(215,plain,
( mtvisible(c_tptp_member2701_mt)
| $false ),
inference(rw,[status(thm)],[207,71,theory(equality)]) ).
cnf(216,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[215,theory(equality)]) ).
cnf(249,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1)
| $false ),
inference(rw,[status(thm)],[133,216,theory(equality)]) ).
cnf(250,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1) ),
inference(cn,[status(thm)],[249,theory(equality)]) ).
cnf(257,negated_conjecture,
~ runningshorts(c_tptprunningshorts),
inference(spm,[status(thm)],[70,250,theory(equality)]) ).
cnf(261,negated_conjecture,
~ mtvisible(c_cyclistsmt),
inference(spm,[status(thm)],[257,148,theory(equality)]) ).
cnf(264,plain,
( mtvisible(c_tptp_spindleheadmt)
| $false ),
inference(rw,[status(thm)],[211,214,theory(equality)]) ).
cnf(265,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[264,theory(equality)]) ).
cnf(273,plain,
( mtvisible(c_cyclistsmt)
| $false ),
inference(rw,[status(thm)],[212,265,theory(equality)]) ).
cnf(274,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[273,theory(equality)]) ).
cnf(275,plain,
$false,
inference(sr,[status(thm)],[274,261,theory(equality)]) ).
cnf(276,plain,
$false,
275,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR026+1.p
% --creating new selector for [CSR002+0.ax]
% -running prover on /tmp/tmp0_QqwS/sel_CSR026+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR026+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR026+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR026+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
%
%------------------------------------------------------------------------------