TSTP Solution File: SWV365+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV365+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 12:31:14 EST 2010
% Result : Theorem 241.62s
% Output : CNFRefutation 241.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 22 ( 2 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(31,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/tmp/tmpvWM4vR/sel_SWV365+1.p_5',ax54) ).
fof(35,conjecture,
! [X1,X2,X4,X5] : i(triple(X1,create_slb,X4)) = i(triple(X2,create_slb,X5)),
file('/tmp/tmpvWM4vR/sel_SWV365+1.p_5',l1_co) ).
fof(36,negated_conjecture,
~ ! [X1,X2,X4,X5] : i(triple(X1,create_slb,X4)) = i(triple(X2,create_slb,X5)),
inference(assume_negation,[status(cth)],[35]) ).
fof(132,plain,
! [X3,X4] : i(triple(X3,create_slb,X4)) = create_pq,
inference(variable_rename,[status(thm)],[31]) ).
cnf(133,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[132]) ).
fof(141,negated_conjecture,
? [X1,X2,X4,X5] : i(triple(X1,create_slb,X4)) != i(triple(X2,create_slb,X5)),
inference(fof_nnf,[status(thm)],[36]) ).
fof(142,negated_conjecture,
? [X6,X7,X8,X9] : i(triple(X6,create_slb,X8)) != i(triple(X7,create_slb,X9)),
inference(variable_rename,[status(thm)],[141]) ).
fof(143,negated_conjecture,
i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0)),
inference(skolemize,[status(esa)],[142]) ).
cnf(144,negated_conjecture,
i(triple(esk2_0,create_slb,esk4_0)) != i(triple(esk3_0,create_slb,esk5_0)),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(146,negated_conjecture,
create_pq != i(triple(esk2_0,create_slb,esk4_0)),
inference(rw,[status(thm)],[144,133,theory(equality)]) ).
cnf(147,negated_conjecture,
$false,
inference(rw,[status(thm)],[146,133,theory(equality)]) ).
cnf(148,negated_conjecture,
$false,
inference(cn,[status(thm)],[147,theory(equality)]) ).
cnf(149,negated_conjecture,
$false,
148,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV365+1.p
% --creating new selector for [SWV007+4.ax, SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpvWM4vR/sel_SWV365+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpvWM4vR/sel_SWV365+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [SWV007+4.ax, SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpvWM4vR/sel_SWV365+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [SWV007+4.ax, SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpvWM4vR/sel_SWV365+1.p_4 with time limit 56
% -prover status ResourceOut
% --creating new selector for [SWV007+4.ax, SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax]
% -running prover on /tmp/tmpvWM4vR/sel_SWV365+1.p_5 with time limit 55
% -prover status Theorem
% Problem SWV365+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV365+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV365+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
%
%------------------------------------------------------------------------------