TSTP Solution File: SWV128+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV128+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %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 : Sun Dec 26 12:16:06 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 6 unt; 0 def)
% Number of atoms : 82 ( 21 equ)
% Maximal formula atoms : 24 ( 7 avg)
% Number of connectives : 75 ( 4 ~; 0 |; 52 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(26,axiom,
true,
file('/tmp/tmpA8rdpN/sel_SWV128+1.p_1',ttrue) ).
fof(68,conjecture,
( ( t_defuse = use
& tvar_defuse = use
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,minus(m_measvars,n1))
& leq(X5,minus(n_steps,n1)) )
=> a_select3(rho_defuse,X4,X5) = use )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n7)
& leq(X7,minus(n_steps,n1)) )
=> a_select3(tr_defuse,X6,X7) = use )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,minus(n_statevars,n1)) )
=> a_select2(xinit_defuse,X8) = use )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,minus(n_statevars,n1)) )
=> a_select2(xinit_mean_defuse,X9) = use )
& ! [X10,X11] :
( ( leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(m_measvars,n1))
& leq(X11,minus(n_steps,n1)) )
=> a_select3(z_defuse,X10,X11) = use ) )
=> true ),
file('/tmp/tmpA8rdpN/sel_SWV128+1.p_1',thruster_inuse_0001) ).
fof(71,negated_conjecture,
~ ( ( t_defuse = use
& tvar_defuse = use
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,minus(m_measvars,n1))
& leq(X5,minus(n_steps,n1)) )
=> a_select3(rho_defuse,X4,X5) = use )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n7)
& leq(X7,minus(n_steps,n1)) )
=> a_select3(tr_defuse,X6,X7) = use )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,minus(n_statevars,n1)) )
=> a_select2(xinit_defuse,X8) = use )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,minus(n_statevars,n1)) )
=> a_select2(xinit_mean_defuse,X9) = use )
& ! [X10,X11] :
( ( leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(m_measvars,n1))
& leq(X11,minus(n_steps,n1)) )
=> a_select3(z_defuse,X10,X11) = use ) )
=> true ),
inference(assume_negation,[status(cth)],[68]) ).
fof(73,plain,
( epred1_0
=> ( t_defuse = use
& tvar_defuse = use
& ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,minus(m_measvars,n1))
& leq(X5,minus(n_steps,n1)) )
=> a_select3(rho_defuse,X4,X5) = use )
& ! [X6,X7] :
( ( leq(n0,X6)
& leq(n0,X7)
& leq(X6,n7)
& leq(X7,minus(n_steps,n1)) )
=> a_select3(tr_defuse,X6,X7) = use )
& ! [X8] :
( ( leq(n0,X8)
& leq(X8,minus(n_statevars,n1)) )
=> a_select2(xinit_defuse,X8) = use )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,minus(n_statevars,n1)) )
=> a_select2(xinit_mean_defuse,X9) = use )
& ! [X10,X11] :
( ( leq(n0,X10)
& leq(n0,X11)
& leq(X10,minus(m_measvars,n1))
& leq(X11,minus(n_steps,n1)) )
=> a_select3(z_defuse,X10,X11) = use ) ) ),
introduced(definition) ).
fof(74,negated_conjecture,
~ ( epred1_0
=> true ),
inference(apply_def,[status(esa)],[71,73,theory(equality)]) ).
cnf(134,plain,
true,
inference(split_conjunct,[status(thm)],[26]) ).
fof(194,negated_conjecture,
( epred1_0
& ~ true ),
inference(fof_nnf,[status(thm)],[74]) ).
cnf(195,negated_conjecture,
~ true,
inference(split_conjunct,[status(thm)],[194]) ).
cnf(238,negated_conjecture,
$false,
inference(rw,[status(thm)],[195,134,theory(equality)]) ).
cnf(239,negated_conjecture,
$false,
inference(cn,[status(thm)],[238,theory(equality)]) ).
cnf(240,negated_conjecture,
$false,
239,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV128+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpA8rdpN/sel_SWV128+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV128+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV128+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV128+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
%
%------------------------------------------------------------------------------