TSTP Solution File: SYN070+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN070+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:12:18 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 46 ( 7 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 188 ( 68 ~; 77 |; 33 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 72 ( 14 sgn 30 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ( big_f(X1)
& big_f(X2)
& big_h(X1,X2) )
=> ~ big_j(X2,X1) ),
file('/tmp/tmpeU0fS4/sel_SYN070+1.p_1',pel46_3) ).
fof(2,axiom,
( ? [X1] :
( big_f(X1)
& ~ big_g(X1) )
=> ? [X3] :
( big_f(X3)
& ~ big_g(X3)
& ! [X2] :
( ( big_f(X2)
& ~ big_g(X2) )
=> big_j(X3,X2) ) ) ),
file('/tmp/tmpeU0fS4/sel_SYN070+1.p_1',pel46_2) ).
fof(3,axiom,
! [X1,X2] :
( ( big_f(X1)
& ( ( big_f(X2)
& big_h(X2,X1) )
=> big_g(X2) ) )
=> big_g(X1) ),
file('/tmp/tmpeU0fS4/sel_SYN070+1.p_1',pel46_1) ).
fof(4,conjecture,
! [X1] :
( big_f(X1)
=> big_g(X1) ),
file('/tmp/tmpeU0fS4/sel_SYN070+1.p_1',pel46) ).
fof(5,negated_conjecture,
~ ! [X1] :
( big_f(X1)
=> big_g(X1) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(6,plain,
! [X1,X2] :
( ( big_f(X1)
& big_f(X2)
& big_h(X1,X2) )
=> ~ big_j(X2,X1) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(7,plain,
( ? [X1] :
( big_f(X1)
& ~ big_g(X1) )
=> ? [X3] :
( big_f(X3)
& ~ big_g(X3)
& ! [X2] :
( ( big_f(X2)
& ~ big_g(X2) )
=> big_j(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(8,plain,
! [X1,X2] :
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X1,X2)
| ~ big_j(X2,X1) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(9,plain,
! [X3,X4] :
( ~ big_f(X3)
| ~ big_f(X4)
| ~ big_h(X3,X4)
| ~ big_j(X4,X3) ),
inference(variable_rename,[status(thm)],[8]) ).
cnf(10,plain,
( ~ big_j(X1,X2)
| ~ big_h(X2,X1)
| ~ big_f(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(11,plain,
( ! [X1] :
( ~ big_f(X1)
| big_g(X1) )
| ? [X3] :
( big_f(X3)
& ~ big_g(X3)
& ! [X2] :
( ~ big_f(X2)
| big_g(X2)
| big_j(X3,X2) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(12,plain,
( ! [X4] :
( ~ big_f(X4)
| big_g(X4) )
| ? [X5] :
( big_f(X5)
& ~ big_g(X5)
& ! [X6] :
( ~ big_f(X6)
| big_g(X6)
| big_j(X5,X6) ) ) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(13,plain,
( ! [X4] :
( ~ big_f(X4)
| big_g(X4) )
| ( big_f(esk1_0)
& ~ big_g(esk1_0)
& ! [X6] :
( ~ big_f(X6)
| big_g(X6)
| big_j(esk1_0,X6) ) ) ),
inference(skolemize,[status(esa)],[12]) ).
fof(14,plain,
! [X4,X6] :
( ( ( ~ big_f(X6)
| big_g(X6)
| big_j(esk1_0,X6) )
& big_f(esk1_0)
& ~ big_g(esk1_0) )
| ~ big_f(X4)
| big_g(X4) ),
inference(shift_quantors,[status(thm)],[13]) ).
fof(15,plain,
! [X4,X6] :
( ( ~ big_f(X6)
| big_g(X6)
| big_j(esk1_0,X6)
| ~ big_f(X4)
| big_g(X4) )
& ( big_f(esk1_0)
| ~ big_f(X4)
| big_g(X4) )
& ( ~ big_g(esk1_0)
| ~ big_f(X4)
| big_g(X4) ) ),
inference(distribute,[status(thm)],[14]) ).
cnf(18,plain,
( big_g(X1)
| big_j(esk1_0,X2)
| big_g(X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[15]) ).
fof(19,plain,
! [X1,X2] :
( ~ big_f(X1)
| ( big_f(X2)
& big_h(X2,X1)
& ~ big_g(X2) )
| big_g(X1) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(20,plain,
! [X3,X4] :
( ~ big_f(X3)
| ( big_f(X4)
& big_h(X4,X3)
& ~ big_g(X4) )
| big_g(X3) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,plain,
! [X3,X4] :
( ( big_f(X4)
| ~ big_f(X3)
| big_g(X3) )
& ( big_h(X4,X3)
| ~ big_f(X3)
| big_g(X3) )
& ( ~ big_g(X4)
| ~ big_f(X3)
| big_g(X3) ) ),
inference(distribute,[status(thm)],[20]) ).
cnf(22,plain,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(X2) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
( big_g(X1)
| big_h(X2,X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(24,plain,
( big_g(X1)
| big_f(X2)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(25,negated_conjecture,
? [X1] :
( big_f(X1)
& ~ big_g(X1) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(26,negated_conjecture,
? [X2] :
( big_f(X2)
& ~ big_g(X2) ),
inference(variable_rename,[status(thm)],[25]) ).
fof(27,negated_conjecture,
( big_f(esk2_0)
& ~ big_g(esk2_0) ),
inference(skolemize,[status(esa)],[26]) ).
cnf(28,negated_conjecture,
~ big_g(esk2_0),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(29,negated_conjecture,
big_f(esk2_0),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(30,negated_conjecture,
( big_g(esk2_0)
| big_f(X1) ),
inference(spm,[status(thm)],[24,29,theory(equality)]) ).
cnf(31,negated_conjecture,
big_f(X1),
inference(sr,[status(thm)],[30,28,theory(equality)]) ).
cnf(32,plain,
( big_g(X2)
| big_g(X1)
| big_j(esk1_0,X2)
| ~ big_f(X2) ),
inference(csr,[status(thm)],[18,24]) ).
cnf(33,plain,
( big_g(X2)
| big_j(esk1_0,X2)
| ~ big_f(X2) ),
inference(csr,[status(thm)],[32,22]) ).
cnf(36,plain,
( big_g(X1)
| big_j(esk1_0,X1)
| $false ),
inference(rw,[status(thm)],[33,31,theory(equality)]) ).
cnf(37,plain,
( big_g(X1)
| big_j(esk1_0,X1) ),
inference(cn,[status(thm)],[36,theory(equality)]) ).
cnf(38,plain,
( ~ big_j(X1,X2)
| ~ big_h(X2,X1)
| $false
| ~ big_f(X1) ),
inference(rw,[status(thm)],[10,31,theory(equality)]) ).
cnf(39,plain,
( ~ big_j(X1,X2)
| ~ big_h(X2,X1)
| $false
| $false ),
inference(rw,[status(thm)],[38,31,theory(equality)]) ).
cnf(40,plain,
( ~ big_j(X1,X2)
| ~ big_h(X2,X1) ),
inference(cn,[status(thm)],[39,theory(equality)]) ).
cnf(41,plain,
( big_g(X1)
| big_h(X2,X1)
| $false ),
inference(rw,[status(thm)],[23,31,theory(equality)]) ).
cnf(42,plain,
( big_g(X1)
| big_h(X2,X1) ),
inference(cn,[status(thm)],[41,theory(equality)]) ).
cnf(43,plain,
( big_g(X1)
| ~ big_g(X2)
| $false ),
inference(rw,[status(thm)],[22,31,theory(equality)]) ).
cnf(44,plain,
( big_g(X1)
| ~ big_g(X2) ),
inference(cn,[status(thm)],[43,theory(equality)]) ).
cnf(48,plain,
( big_g(X1)
| ~ big_h(X1,esk1_0) ),
inference(spm,[status(thm)],[40,37,theory(equality)]) ).
cnf(49,plain,
( big_g(X1)
| big_g(esk1_0) ),
inference(spm,[status(thm)],[48,42,theory(equality)]) ).
cnf(50,plain,
big_g(X1),
inference(csr,[status(thm)],[49,44]) ).
cnf(51,negated_conjecture,
$false,
inference(rw,[status(thm)],[28,50,theory(equality)]) ).
cnf(52,negated_conjecture,
$false,
inference(cn,[status(thm)],[51,theory(equality)]) ).
cnf(53,negated_conjecture,
$false,
52,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN070+1.p
% --creating new selector for []
% -running prover on /tmp/tmpeU0fS4/sel_SYN070+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN070+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN070+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN070+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
%
%------------------------------------------------------------------------------