TSTP Solution File: SYN332+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN332+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:14:55 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 205 ( 0 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 255 ( 79 ~; 88 |; 55 &)
% ( 16 <=>; 15 =>; 0 <=; 2 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 52 ( 2 sgn 11 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1,X2] :
! [X3] :
( ( ( big_f(X1,X2)
& big_f(X2,X1) )
<~> big_f(X1,X3) )
=> ( ( big_f(X1,X3)
<=> big_f(X3,X1) )
=> ( ( big_f(X1,X3)
<=> big_f(X2,X3) )
=> ( ( ( big_f(X2,X1)
=> big_f(X1,X2) )
<=> big_f(X3,X3) )
=> ( ( big_f(X1,X2)
<=> big_f(X2,X1) )
<=> big_f(X3,X2) ) ) ) ) ),
file('/tmp/tmpBzqgKF/sel_SYN332+1.p_1',church_46_14_4) ).
fof(2,negated_conjecture,
~ ? [X1,X2] :
! [X3] :
( ( ( big_f(X1,X2)
& big_f(X2,X1) )
<~> big_f(X1,X3) )
=> ( ( big_f(X1,X3)
<=> big_f(X3,X1) )
=> ( ( big_f(X1,X3)
<=> big_f(X2,X3) )
=> ( ( ( big_f(X2,X1)
=> big_f(X1,X2) )
<=> big_f(X3,X3) )
=> ( ( big_f(X1,X2)
<=> big_f(X2,X1) )
<=> big_f(X3,X2) ) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ? [X1,X2] :
! [X3] :
( ~ ( ( big_f(X1,X2)
& big_f(X2,X1) )
<=> big_f(X1,X3) )
=> ( ( big_f(X1,X3)
<=> big_f(X3,X1) )
=> ( ( big_f(X1,X3)
<=> big_f(X2,X3) )
=> ( ( ( big_f(X2,X1)
=> big_f(X1,X2) )
<=> big_f(X3,X3) )
=> ( ( big_f(X1,X2)
<=> big_f(X2,X1) )
<=> big_f(X3,X2) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
! [X1,X2] :
? [X3] :
( ( ~ big_f(X1,X2)
| ~ big_f(X2,X1)
| ~ big_f(X1,X3) )
& ( ( big_f(X1,X2)
& big_f(X2,X1) )
| big_f(X1,X3) )
& ( ~ big_f(X1,X3)
| big_f(X3,X1) )
& ( ~ big_f(X3,X1)
| big_f(X1,X3) )
& ( ~ big_f(X1,X3)
| big_f(X2,X3) )
& ( ~ big_f(X2,X3)
| big_f(X1,X3) )
& ( ( big_f(X2,X1)
& ~ big_f(X1,X2) )
| big_f(X3,X3) )
& ( ~ big_f(X3,X3)
| ~ big_f(X2,X1)
| big_f(X1,X2) )
& ( ( ( ~ big_f(X1,X2)
| ~ big_f(X2,X1) )
& ( big_f(X1,X2)
| big_f(X2,X1) ) )
| ~ big_f(X3,X2) )
& ( ( ( ~ big_f(X1,X2)
| big_f(X2,X1) )
& ( ~ big_f(X2,X1)
| big_f(X1,X2) ) )
| big_f(X3,X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X4,X5] :
? [X6] :
( ( ~ big_f(X4,X5)
| ~ big_f(X5,X4)
| ~ big_f(X4,X6) )
& ( ( big_f(X4,X5)
& big_f(X5,X4) )
| big_f(X4,X6) )
& ( ~ big_f(X4,X6)
| big_f(X6,X4) )
& ( ~ big_f(X6,X4)
| big_f(X4,X6) )
& ( ~ big_f(X4,X6)
| big_f(X5,X6) )
& ( ~ big_f(X5,X6)
| big_f(X4,X6) )
& ( ( big_f(X5,X4)
& ~ big_f(X4,X5) )
| big_f(X6,X6) )
& ( ~ big_f(X6,X6)
| ~ big_f(X5,X4)
| big_f(X4,X5) )
& ( ( ( ~ big_f(X4,X5)
| ~ big_f(X5,X4) )
& ( big_f(X4,X5)
| big_f(X5,X4) ) )
| ~ big_f(X6,X5) )
& ( ( ( ~ big_f(X4,X5)
| big_f(X5,X4) )
& ( ~ big_f(X5,X4)
| big_f(X4,X5) ) )
| big_f(X6,X5) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
! [X4,X5] :
( ( ~ big_f(X4,X5)
| ~ big_f(X5,X4)
| ~ big_f(X4,esk1_2(X4,X5)) )
& ( ( big_f(X4,X5)
& big_f(X5,X4) )
| big_f(X4,esk1_2(X4,X5)) )
& ( ~ big_f(X4,esk1_2(X4,X5))
| big_f(esk1_2(X4,X5),X4) )
& ( ~ big_f(esk1_2(X4,X5),X4)
| big_f(X4,esk1_2(X4,X5)) )
& ( ~ big_f(X4,esk1_2(X4,X5))
| big_f(X5,esk1_2(X4,X5)) )
& ( ~ big_f(X5,esk1_2(X4,X5))
| big_f(X4,esk1_2(X4,X5)) )
& ( ( big_f(X5,X4)
& ~ big_f(X4,X5) )
| big_f(esk1_2(X4,X5),esk1_2(X4,X5)) )
& ( ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5))
| ~ big_f(X5,X4)
| big_f(X4,X5) )
& ( ( ( ~ big_f(X4,X5)
| ~ big_f(X5,X4) )
& ( big_f(X4,X5)
| big_f(X5,X4) ) )
| ~ big_f(esk1_2(X4,X5),X5) )
& ( ( ( ~ big_f(X4,X5)
| big_f(X5,X4) )
& ( ~ big_f(X5,X4)
| big_f(X4,X5) ) )
| big_f(esk1_2(X4,X5),X5) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X4,X5] :
( ( ~ big_f(X4,X5)
| ~ big_f(X5,X4)
| ~ big_f(X4,esk1_2(X4,X5)) )
& ( big_f(X4,X5)
| big_f(X4,esk1_2(X4,X5)) )
& ( big_f(X5,X4)
| big_f(X4,esk1_2(X4,X5)) )
& ( ~ big_f(X4,esk1_2(X4,X5))
| big_f(esk1_2(X4,X5),X4) )
& ( ~ big_f(esk1_2(X4,X5),X4)
| big_f(X4,esk1_2(X4,X5)) )
& ( ~ big_f(X4,esk1_2(X4,X5))
| big_f(X5,esk1_2(X4,X5)) )
& ( ~ big_f(X5,esk1_2(X4,X5))
| big_f(X4,esk1_2(X4,X5)) )
& ( big_f(X5,X4)
| big_f(esk1_2(X4,X5),esk1_2(X4,X5)) )
& ( ~ big_f(X4,X5)
| big_f(esk1_2(X4,X5),esk1_2(X4,X5)) )
& ( ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5))
| ~ big_f(X5,X4)
| big_f(X4,X5) )
& ( ~ big_f(X4,X5)
| ~ big_f(X5,X4)
| ~ big_f(esk1_2(X4,X5),X5) )
& ( big_f(X4,X5)
| big_f(X5,X4)
| ~ big_f(esk1_2(X4,X5),X5) )
& ( ~ big_f(X4,X5)
| big_f(X5,X4)
| big_f(esk1_2(X4,X5),X5) )
& ( ~ big_f(X5,X4)
| big_f(X4,X5)
| big_f(esk1_2(X4,X5),X5) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
( big_f(X2,X1)
| big_f(X1,X2)
| ~ big_f(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( ~ big_f(esk1_2(X1,X2),X2)
| ~ big_f(X2,X1)
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(X2,X1)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(16,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| ~ big_f(X2,esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(18,negated_conjecture,
( big_f(esk1_2(X1,X2),X1)
| ~ big_f(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(19,negated_conjecture,
( big_f(X1,esk1_2(X1,X2))
| big_f(X2,X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(20,negated_conjecture,
( big_f(X1,esk1_2(X1,X2))
| big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(22,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| big_f(X1,X2) ),
inference(spm,[status(thm)],[16,19,theory(equality)]) ).
cnf(23,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| big_f(X2,X1) ),
inference(spm,[status(thm)],[16,20,theory(equality)]) ).
cnf(29,negated_conjecture,
( big_f(X1,X1)
| ~ big_f(X1,esk1_2(X1,X1)) ),
inference(spm,[status(thm)],[10,18,theory(equality)]) ).
cnf(34,negated_conjecture,
( ~ big_f(X1,X1)
| ~ big_f(X1,esk1_2(X1,X1)) ),
inference(spm,[status(thm)],[11,18,theory(equality)]) ).
cnf(49,negated_conjecture,
big_f(X1,X1),
inference(csr,[status(thm)],[29,23]) ).
cnf(50,negated_conjecture,
( ~ big_f(X1,esk1_2(X1,X1))
| $false ),
inference(rw,[status(thm)],[34,49,theory(equality)]) ).
cnf(51,negated_conjecture,
~ big_f(X1,esk1_2(X1,X1)),
inference(cn,[status(thm)],[50,theory(equality)]) ).
cnf(52,negated_conjecture,
( big_f(X1,X2)
| $false
| ~ big_f(X2,X1) ),
inference(rw,[status(thm)],[12,49,theory(equality)]) ).
cnf(53,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(X2,X1) ),
inference(cn,[status(thm)],[52,theory(equality)]) ).
cnf(59,negated_conjecture,
( big_f(esk1_2(X1,X2),X2)
| big_f(X2,X1) ),
inference(spm,[status(thm)],[53,22,theory(equality)]) ).
cnf(84,negated_conjecture,
( big_f(X1,X2)
| big_f(X2,X1) ),
inference(spm,[status(thm)],[10,59,theory(equality)]) ).
cnf(87,negated_conjecture,
big_f(X1,X2),
inference(csr,[status(thm)],[84,53]) ).
cnf(89,negated_conjecture,
$false,
inference(rw,[status(thm)],[51,87,theory(equality)]) ).
cnf(90,negated_conjecture,
$false,
inference(cn,[status(thm)],[89,theory(equality)]) ).
cnf(91,negated_conjecture,
$false,
90,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN332+1.p
% --creating new selector for []
% -running prover on /tmp/tmpBzqgKF/sel_SYN332+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN332+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN332+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN332+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
%
%------------------------------------------------------------------------------