TSTP Solution File: SYN081+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN081+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:13:12 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 35 ( 18 ~; 10 |; 5 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 15 ( 3 sgn 6 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
( big_f(X1)
& ~ big_f(f(X1)) ),
file('/tmp/tmpqDMKKI/sel_SYN081+1.p_1',pel59) ).
fof(2,axiom,
! [X1] :
( big_f(X1)
<=> ~ big_f(f(X1)) ),
file('/tmp/tmpqDMKKI/sel_SYN081+1.p_1',pel59_1) ).
fof(3,negated_conjecture,
~ ? [X1] :
( big_f(X1)
& ~ big_f(f(X1)) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(4,negated_conjecture,
~ ? [X1] :
( big_f(X1)
& ~ big_f(f(X1)) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(5,plain,
! [X1] :
( big_f(X1)
<=> ~ big_f(f(X1)) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(6,negated_conjecture,
! [X1] :
( ~ big_f(X1)
| big_f(f(X1)) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(7,negated_conjecture,
! [X2] :
( ~ big_f(X2)
| big_f(f(X2)) ),
inference(variable_rename,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( big_f(f(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
fof(9,plain,
! [X1] :
( ( ~ big_f(X1)
| ~ big_f(f(X1)) )
& ( big_f(f(X1))
| big_f(X1) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(10,plain,
! [X2] :
( ( ~ big_f(X2)
| ~ big_f(f(X2)) )
& ( big_f(f(X2))
| big_f(X2) ) ),
inference(variable_rename,[status(thm)],[9]) ).
cnf(11,plain,
( big_f(X1)
| big_f(f(X1)) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,plain,
( ~ big_f(f(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(13,negated_conjecture,
big_f(f(X1)),
inference(csr,[status(thm)],[8,11]) ).
cnf(15,plain,
( ~ big_f(X1)
| $false ),
inference(rw,[status(thm)],[12,13,theory(equality)]) ).
cnf(16,plain,
~ big_f(X1),
inference(cn,[status(thm)],[15,theory(equality)]) ).
cnf(17,negated_conjecture,
$false,
inference(sr,[status(thm)],[13,16,theory(equality)]) ).
cnf(18,negated_conjecture,
$false,
17,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN081+1.p
% --creating new selector for []
% -running prover on /tmp/tmpqDMKKI/sel_SYN081+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN081+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN081+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN081+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
%
%------------------------------------------------------------------------------