TSTP Solution File: SWV366+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV366+1 : TPTP v5.0.0. Released v3.3.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 : Sun Dec 26 12:26:58 EST 2010
% Result : Theorem 0.30s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 21 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 71 ( 5 sgn 48 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,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/tmp08QQhI/sel_SWV366+1.p_1',ax55) ).
fof(4,conjecture,
! [X1] :
( ! [X2,X3,X4,X5] : i(triple(X2,X1,X4)) = i(triple(X3,X1,X5))
=> ! [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X1,pair(X10,X11)),X8)) = i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)) ),
file('/tmp/tmp08QQhI/sel_SWV366+1.p_1',l2_co) ).
fof(5,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4,X5] : i(triple(X2,X1,X4)) = i(triple(X3,X1,X5))
=> ! [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X1,pair(X10,X11)),X8)) = i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(12,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)],[2]) ).
cnf(13,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[12]) ).
fof(16,negated_conjecture,
? [X1] :
( ! [X2,X3,X4,X5] : i(triple(X2,X1,X4)) = i(triple(X3,X1,X5))
& ? [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X1,pair(X10,X11)),X8)) != i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(17,negated_conjecture,
? [X12] :
( ! [X13,X14,X15,X16] : i(triple(X13,X12,X15)) = i(triple(X14,X12,X16))
& ? [X17,X18,X19,X20,X21,X22] : i(triple(X17,insert_slb(X12,pair(X21,X22)),X19)) != i(triple(X18,insert_slb(X12,pair(X21,X22)),X20)) ),
inference(variable_rename,[status(thm)],[16]) ).
fof(18,negated_conjecture,
( ! [X13,X14,X15,X16] : i(triple(X13,esk1_0,X15)) = i(triple(X14,esk1_0,X16))
& i(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)) != i(triple(esk3_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(skolemize,[status(esa)],[17]) ).
fof(19,negated_conjecture,
! [X13,X14,X15,X16] :
( i(triple(X13,esk1_0,X15)) = i(triple(X14,esk1_0,X16))
& i(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)) != i(triple(esk3_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
inference(shift_quantors,[status(thm)],[18]) ).
cnf(20,negated_conjecture,
i(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)) != i(triple(esk3_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(21,negated_conjecture,
i(triple(X1,esk1_0,X2)) = i(triple(X3,esk1_0,X4)),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(36,negated_conjecture,
insert_pq(i(triple(esk3_0,esk1_0,esk5_0)),esk6_0) != i(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),
inference(rw,[status(thm)],[20,13,theory(equality)]) ).
cnf(37,negated_conjecture,
insert_pq(i(triple(esk3_0,esk1_0,esk5_0)),esk6_0) != insert_pq(i(triple(esk2_0,esk1_0,esk4_0)),esk6_0),
inference(rw,[status(thm)],[36,13,theory(equality)]) ).
cnf(38,negated_conjecture,
$false,
inference(sr,[status(thm)],[37,21,theory(equality)]) ).
cnf(39,negated_conjecture,
$false,
38,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV366+1.p
% --creating new selector for [SWV007+4.ax, SWV007+3.ax, SWV007+0.ax, SWV007+1.ax, SWV007+2.ax]
% -running prover on /tmp/tmp08QQhI/sel_SWV366+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV366+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV366+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV366+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
%
%------------------------------------------------------------------------------