TSTP Solution File: SYN386+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN386+1 : TPTP v5.0.0. Released v2.0.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 13:18:53 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 91 ( 30 ~; 23 |; 26 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 112 ( 6 sgn 62 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
file('/tmp/tmp8kIXTK/sel_SYN386+1.p_1',x2138) ).
fof(2,negated_conjecture,
~ ( ( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( big_d(X7,X8,X6)
=> ! [X2,X9] :
( ( big_f(X7,X2)
& big_f(X8,X9) )
=> big_d(X2,X9,X3) ) ) )
=> ? [X2] :
! [X3] :
? [X10] :
! [X5] :
( big_s(X10,X5)
=> ! [X9] :
( big_f(X5,X9)
=> big_d(X9,X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ! [X1] :
? [X2] : big_f(X1,X2)
& ? [X1] :
! [X3] :
? [X4] :
! [X5] :
( ~ big_s(X4,X5)
| big_d(X5,X1,X3) )
& ! [X3] :
? [X6] :
! [X7,X8] :
( ~ big_d(X7,X8,X6)
| ! [X2,X9] :
( ~ big_f(X7,X2)
| ~ big_f(X8,X9)
| big_d(X2,X9,X3) ) )
& ! [X2] :
? [X3] :
! [X10] :
? [X5] :
( big_s(X10,X5)
& ? [X9] :
( big_f(X5,X9)
& ~ big_d(X9,X2,X3) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ! [X11] :
? [X12] : big_f(X11,X12)
& ? [X13] :
! [X14] :
? [X15] :
! [X16] :
( ~ big_s(X15,X16)
| big_d(X16,X13,X14) )
& ! [X17] :
? [X18] :
! [X19,X20] :
( ~ big_d(X19,X20,X18)
| ! [X21,X22] :
( ~ big_f(X19,X21)
| ~ big_f(X20,X22)
| big_d(X21,X22,X17) ) )
& ! [X23] :
? [X24] :
! [X25] :
? [X26] :
( big_s(X25,X26)
& ? [X27] :
( big_f(X26,X27)
& ~ big_d(X27,X23,X24) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X11] : big_f(X11,esk1_1(X11))
& ! [X14,X16] :
( ~ big_s(esk3_1(X14),X16)
| big_d(X16,esk2_0,X14) )
& ! [X17,X19,X20] :
( ~ big_d(X19,X20,esk4_1(X17))
| ! [X21,X22] :
( ~ big_f(X19,X21)
| ~ big_f(X20,X22)
| big_d(X21,X22,X17) ) )
& ! [X23,X25] :
( big_s(X25,esk6_2(X23,X25))
& big_f(esk6_2(X23,X25),esk7_2(X23,X25))
& ~ big_d(esk7_2(X23,X25),X23,esk5_1(X23)) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X11,X14,X16,X17,X19,X20,X21,X22,X23,X25] :
( big_s(X25,esk6_2(X23,X25))
& big_f(esk6_2(X23,X25),esk7_2(X23,X25))
& ~ big_d(esk7_2(X23,X25),X23,esk5_1(X23))
& ( ~ big_f(X19,X21)
| ~ big_f(X20,X22)
| big_d(X21,X22,X17)
| ~ big_d(X19,X20,esk4_1(X17)) )
& ( ~ big_s(esk3_1(X14),X16)
| big_d(X16,esk2_0,X14) )
& big_f(X11,esk1_1(X11)) ),
inference(shift_quantors,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
big_f(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( big_d(X1,esk2_0,X2)
| ~ big_s(esk3_1(X2),X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
( big_d(X4,X5,X3)
| ~ big_d(X1,X2,esk4_1(X3))
| ~ big_f(X2,X5)
| ~ big_f(X1,X4) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
~ big_d(esk7_2(X1,X2),X1,esk5_1(X1)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
big_f(esk6_2(X1,X2),esk7_2(X1,X2)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
big_s(X1,esk6_2(X2,X1)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(13,negated_conjecture,
big_d(esk6_2(X1,esk3_1(X2)),esk2_0,X2),
inference(spm,[status(thm)],[8,12,theory(equality)]) ).
cnf(14,negated_conjecture,
( big_d(X1,X2,X3)
| ~ big_f(esk2_0,X2)
| ~ big_f(esk6_2(X4,esk3_1(esk4_1(X3))),X1) ),
inference(spm,[status(thm)],[9,13,theory(equality)]) ).
cnf(16,negated_conjecture,
( big_d(esk7_2(X1,esk3_1(esk4_1(X2))),X3,X2)
| ~ big_f(esk2_0,X3) ),
inference(spm,[status(thm)],[14,11,theory(equality)]) ).
cnf(17,negated_conjecture,
~ big_f(esk2_0,X1),
inference(spm,[status(thm)],[10,16,theory(equality)]) ).
cnf(26,negated_conjecture,
$false,
inference(spm,[status(thm)],[17,7,theory(equality)]) ).
cnf(27,negated_conjecture,
$false,
26,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN386+1.p
% --creating new selector for []
% -running prover on /tmp/tmp8kIXTK/sel_SYN386+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN386+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN386+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN386+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
%
%------------------------------------------------------------------------------