TSTP Solution File: SWV415+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV415+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:40:41 EST 2010
% Result : Theorem 239.72s
% Output : CNFRefutation 239.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 19 unt; 0 def)
% Number of atoms : 19 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 70 ( 13 sgn 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/tmp/tmpnXZwsQ/sel_SWV415+1.p_5',ax42) ).
fof(34,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/tmp/tmpnXZwsQ/sel_SWV415+1.p_5',ax55) ).
fof(37,conjecture,
! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/tmp/tmpnXZwsQ/sel_SWV415+1.p_5',co2) ).
fof(38,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,X3,X4)) = i(triple(X2,X3,X5)),
file('/tmp/tmpnXZwsQ/sel_SWV415+1.p_5',main2_l12) ).
fof(39,negated_conjecture,
~ ! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
inference(assume_negation,[status(cth)],[37]) ).
fof(63,plain,
! [X5,X6,X7,X8] : insert_cpq(triple(X5,X6,X7),X8) = triple(insert_pqp(X5,X8),insert_slb(X6,pair(X8,bottom)),X7),
inference(variable_rename,[status(thm)],[7]) ).
cnf(64,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[63]) ).
fof(142,plain,
! [X6,X7,X8,X9,X10] : i(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) = insert_pq(i(triple(X6,X7,X8)),X9),
inference(variable_rename,[status(thm)],[34]) ).
cnf(143,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[142]) ).
fof(149,negated_conjecture,
? [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) != insert_pq(i(triple(X1,X2,X3)),X4),
inference(fof_nnf,[status(thm)],[39]) ).
fof(150,negated_conjecture,
? [X5,X6,X7,X8] : i(insert_cpq(triple(X5,X6,X7),X8)) != insert_pq(i(triple(X5,X6,X7)),X8),
inference(variable_rename,[status(thm)],[149]) ).
fof(151,negated_conjecture,
i(insert_cpq(triple(esk2_0,esk3_0,esk4_0),esk5_0)) != insert_pq(i(triple(esk2_0,esk3_0,esk4_0)),esk5_0),
inference(skolemize,[status(esa)],[150]) ).
cnf(152,negated_conjecture,
i(insert_cpq(triple(esk2_0,esk3_0,esk4_0),esk5_0)) != insert_pq(i(triple(esk2_0,esk3_0,esk4_0)),esk5_0),
inference(split_conjunct,[status(thm)],[151]) ).
fof(153,plain,
! [X6,X7,X8,X9,X10] : i(triple(X6,X8,X9)) = i(triple(X7,X8,X10)),
inference(variable_rename,[status(thm)],[38]) ).
cnf(154,plain,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(split_conjunct,[status(thm)],[153]) ).
cnf(199,plain,
i(insert_cpq(triple(X1,X3,X4),X2)) = i(triple(X5,insert_slb(X3,pair(X2,bottom)),X6)),
inference(spm,[status(thm)],[154,64,theory(equality)]) ).
cnf(203,plain,
i(insert_cpq(triple(X1,X3,X4),X2)) = insert_pq(i(triple(X5,X3,X6)),X2),
inference(rw,[status(thm)],[199,143,theory(equality)]) ).
cnf(484,negated_conjecture,
$false,
inference(sr,[status(thm)],[152,203,theory(equality)]) ).
cnf(485,negated_conjecture,
$false,
484,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV415+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/tmpnXZwsQ/sel_SWV415+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpnXZwsQ/sel_SWV415+1.p_2 with time limit 80
% -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/tmpnXZwsQ/sel_SWV415+1.p_3 with time limit 75
% -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/tmpnXZwsQ/sel_SWV415+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/tmpnXZwsQ/sel_SWV415+1.p_5 with time limit 54
% -prover status Theorem
% Problem SWV415+1.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV415+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV415+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
%
%------------------------------------------------------------------------------