TSTP Solution File: SYN317+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN317+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:49 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 103 ( 39 ~; 40 |; 16 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 37 ( 8 sgn 17 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ? [X1] :
( big_f(X1)
=> big_g(X1) )
<=> ? [X1,X2] :
( big_f(X1)
=> big_g(X2) ) ),
file('/tmp/tmp_4hh5V/sel_SYN317+1.p_1',church_46_2_3) ).
fof(2,negated_conjecture,
~ ( ? [X1] :
( big_f(X1)
=> big_g(X1) )
<=> ? [X1,X2] :
( big_f(X1)
=> big_g(X2) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ! [X1] :
( big_f(X1)
& ~ big_g(X1) )
| ! [X1,X2] :
( big_f(X1)
& ~ big_g(X2) ) )
& ( ? [X1] :
( ~ big_f(X1)
| big_g(X1) )
| ? [X1,X2] :
( ~ big_f(X1)
| big_g(X2) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( ! [X3] :
( big_f(X3)
& ~ big_g(X3) )
| ! [X4,X5] :
( big_f(X4)
& ~ big_g(X5) ) )
& ( ? [X6] :
( ~ big_f(X6)
| big_g(X6) )
| ? [X7,X8] :
( ~ big_f(X7)
| big_g(X8) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ! [X3] :
( big_f(X3)
& ~ big_g(X3) )
| ! [X4,X5] :
( big_f(X4)
& ~ big_g(X5) ) )
& ( ~ big_f(esk1_0)
| big_g(esk1_0)
| ~ big_f(esk2_0)
| big_g(esk3_0) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X3,X4,X5] :
( ( ( big_f(X4)
& ~ big_g(X5) )
| ( big_f(X3)
& ~ big_g(X3) ) )
& ( ~ big_f(esk1_0)
| big_g(esk1_0)
| ~ big_f(esk2_0)
| big_g(esk3_0) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X3,X4,X5] :
( ( big_f(X3)
| big_f(X4) )
& ( ~ big_g(X3)
| big_f(X4) )
& ( big_f(X3)
| ~ big_g(X5) )
& ( ~ big_g(X3)
| ~ big_g(X5) )
& ( ~ big_f(esk1_0)
| big_g(esk1_0)
| ~ big_f(esk2_0)
| big_g(esk3_0) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( big_g(esk3_0)
| big_g(esk1_0)
| ~ big_f(esk2_0)
| ~ big_f(esk1_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( ~ big_g(X1)
| ~ big_g(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( big_f(X1)
| big_f(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(13,negated_conjecture,
big_f(X3),
inference(ef,[status(thm)],[12,theory(equality)]) ).
fof(15,plain,
( ~ epred1_0
<=> ! [X2] : ~ big_g(X2) ),
introduced(definition),
[split] ).
cnf(16,plain,
( epred1_0
| ~ big_g(X2) ),
inference(split_equiv,[status(thm)],[15]) ).
fof(17,plain,
( ~ epred2_0
<=> ! [X1] : ~ big_g(X1) ),
introduced(definition),
[split] ).
cnf(18,plain,
( epred2_0
| ~ big_g(X1) ),
inference(split_equiv,[status(thm)],[17]) ).
cnf(19,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[9,15,theory(equality)]),17,theory(equality)]),
[split] ).
cnf(21,negated_conjecture,
( big_g(esk3_0)
| big_g(esk1_0)
| $false
| ~ big_f(esk2_0) ),
inference(rw,[status(thm)],[8,13,theory(equality)]) ).
cnf(22,negated_conjecture,
( big_g(esk3_0)
| big_g(esk1_0)
| $false
| $false ),
inference(rw,[status(thm)],[21,13,theory(equality)]) ).
cnf(23,negated_conjecture,
( big_g(esk3_0)
| big_g(esk1_0) ),
inference(cn,[status(thm)],[22,theory(equality)]) ).
cnf(28,negated_conjecture,
( epred1_0
| big_g(esk1_0) ),
inference(spm,[status(thm)],[16,23,theory(equality)]) ).
cnf(29,negated_conjecture,
epred1_0,
inference(csr,[status(thm)],[28,16]) ).
cnf(31,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[19,29,theory(equality)]) ).
cnf(32,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[31,theory(equality)]) ).
cnf(33,negated_conjecture,
~ big_g(X1),
inference(sr,[status(thm)],[18,32,theory(equality)]) ).
cnf(34,negated_conjecture,
big_g(esk3_0),
inference(sr,[status(thm)],[23,33,theory(equality)]) ).
cnf(35,negated_conjecture,
$false,
inference(sr,[status(thm)],[34,33,theory(equality)]) ).
cnf(36,negated_conjecture,
$false,
35,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN317+1.p
% --creating new selector for []
% -running prover on /tmp/tmp_4hh5V/sel_SYN317+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN317+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN317+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN317+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
%
%------------------------------------------------------------------------------