TSTP Solution File: SWV369+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV369+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:27:24 EST 2010
% Result : Theorem 239.63s
% Output : CNFRefutation 239.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 15 unt; 0 def)
% Number of atoms : 47 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 13 |; 5 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 42 ( 6 sgn 28 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,axiom,
! [X1] : ~ contains_pq(create_pq,X1),
file('/tmp/tmpnPNDm0/sel_SWV369+1.p_5',ax8) ).
fof(18,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/tmp/tmpnPNDm0/sel_SWV369+1.p_5',ax20) ).
fof(31,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/tmp/tmpnPNDm0/sel_SWV369+1.p_5',ax39) ).
fof(32,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/tmp/tmpnPNDm0/sel_SWV369+1.p_5',ax54) ).
fof(36,conjecture,
! [X1,X2,X3] :
( contains_cpq(triple(X1,create_slb,X2),X3)
<=> contains_pq(i(triple(X1,create_slb,X2)),X3) ),
file('/tmp/tmpnPNDm0/sel_SWV369+1.p_5',l5_co) ).
fof(37,negated_conjecture,
~ ! [X1,X2,X3] :
( contains_cpq(triple(X1,create_slb,X2),X3)
<=> contains_pq(i(triple(X1,create_slb,X2)),X3) ),
inference(assume_negation,[status(cth)],[36]) ).
fof(41,plain,
! [X1] : ~ contains_pq(create_pq,X1),
inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).
fof(42,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(82,plain,
! [X2] : ~ contains_pq(create_pq,X2),
inference(variable_rename,[status(thm)],[41]) ).
cnf(83,plain,
~ contains_pq(create_pq,X1),
inference(split_conjunct,[status(thm)],[82]) ).
fof(92,plain,
! [X2] : ~ contains_slb(create_slb,X2),
inference(variable_rename,[status(thm)],[42]) ).
cnf(93,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[92]) ).
fof(133,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_cpq(triple(X1,X2,X3),X4)
| contains_slb(X2,X4) )
& ( ~ contains_slb(X2,X4)
| contains_cpq(triple(X1,X2,X3),X4) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(134,plain,
! [X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_slb(X6,X8) )
& ( ~ contains_slb(X6,X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(variable_rename,[status(thm)],[133]) ).
cnf(136,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[134]) ).
fof(137,plain,
! [X3,X4] : i(triple(X3,create_slb,X4)) = create_pq,
inference(variable_rename,[status(thm)],[32]) ).
cnf(138,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[137]) ).
fof(146,negated_conjecture,
? [X1,X2,X3] :
( ( ~ contains_cpq(triple(X1,create_slb,X2),X3)
| ~ contains_pq(i(triple(X1,create_slb,X2)),X3) )
& ( contains_cpq(triple(X1,create_slb,X2),X3)
| contains_pq(i(triple(X1,create_slb,X2)),X3) ) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(147,negated_conjecture,
? [X4,X5,X6] :
( ( ~ contains_cpq(triple(X4,create_slb,X5),X6)
| ~ contains_pq(i(triple(X4,create_slb,X5)),X6) )
& ( contains_cpq(triple(X4,create_slb,X5),X6)
| contains_pq(i(triple(X4,create_slb,X5)),X6) ) ),
inference(variable_rename,[status(thm)],[146]) ).
fof(148,negated_conjecture,
( ( ~ contains_cpq(triple(esk2_0,create_slb,esk3_0),esk4_0)
| ~ contains_pq(i(triple(esk2_0,create_slb,esk3_0)),esk4_0) )
& ( contains_cpq(triple(esk2_0,create_slb,esk3_0),esk4_0)
| contains_pq(i(triple(esk2_0,create_slb,esk3_0)),esk4_0) ) ),
inference(skolemize,[status(esa)],[147]) ).
cnf(149,negated_conjecture,
( contains_pq(i(triple(esk2_0,create_slb,esk3_0)),esk4_0)
| contains_cpq(triple(esk2_0,create_slb,esk3_0),esk4_0) ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(157,negated_conjecture,
( contains_cpq(triple(esk2_0,create_slb,esk3_0),esk4_0)
| contains_pq(create_pq,esk4_0) ),
inference(rw,[status(thm)],[149,138,theory(equality)]) ).
cnf(158,negated_conjecture,
contains_cpq(triple(esk2_0,create_slb,esk3_0),esk4_0),
inference(sr,[status(thm)],[157,83,theory(equality)]) ).
cnf(161,negated_conjecture,
contains_slb(create_slb,esk4_0),
inference(spm,[status(thm)],[136,158,theory(equality)]) ).
cnf(163,negated_conjecture,
$false,
inference(sr,[status(thm)],[161,93,theory(equality)]) ).
cnf(164,negated_conjecture,
$false,
163,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV369+1.p
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpnPNDm0/sel_SWV369+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpnPNDm0/sel_SWV369+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpnPNDm0/sel_SWV369+1.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpnPNDm0/sel_SWV369+1.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax, SWV007+4.ax]
% -running prover on /tmp/tmpnPNDm0/sel_SWV369+1.p_5 with time limit 54
% -prover status Theorem
% Problem SWV369+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV369+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV369+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
%
%------------------------------------------------------------------------------