%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL414+1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 : Sat Dec 25 17:24:04 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 81 ( 33 ~; 20 |; 28 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 84 ( 2 sgn 63 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ( ! [X1,X2] :
( ~ a_truth(implies(X1,X2))
| ~ a_truth(X1)
| a_truth(X2) )
& ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
& ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
& ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
& ? [X4] : ~ a_truth(implies(X4,X4)) ),
file('/tmp/tmp6F8Bbj/sel_LCL414+1.p_1',thm147) ).
fof(2,negated_conjecture,
~ ~ ( ! [X1,X2] :
( ~ a_truth(implies(X1,X2))
| ~ a_truth(X1)
| a_truth(X2) )
& ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
& ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
& ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
& ? [X4] : ~ a_truth(implies(X4,X4)) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ~ ( ! [X1,X2] :
( ~ a_truth(implies(X1,X2))
| ~ a_truth(X1)
| a_truth(X2) )
& ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
& ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
& ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
& ? [X4] : ~ a_truth(implies(X4,X4)) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
( ! [X1,X2] :
( ~ a_truth(implies(X1,X2))
| ~ a_truth(X1)
| a_truth(X2) )
& ! [X1,X2] : a_truth(implies(X1,implies(X2,X1)))
& ! [X1,X2,X3] : a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))
& ! [X1,X2] : a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1)))
& ? [X4] : ~ a_truth(implies(X4,X4)) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X5,X6] :
( ~ a_truth(implies(X5,X6))
| ~ a_truth(X5)
| a_truth(X6) )
& ! [X7,X8] : a_truth(implies(X7,implies(X8,X7)))
& ! [X9,X10,X11] : a_truth(implies(implies(X9,implies(X10,X11)),implies(implies(X9,X10),implies(X9,X11))))
& ! [X12,X13] : a_truth(implies(implies(not(X12),not(X13)),implies(X13,X12)))
& ? [X14] : ~ a_truth(implies(X14,X14)) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ! [X5,X6] :
( ~ a_truth(implies(X5,X6))
| ~ a_truth(X5)
| a_truth(X6) )
& ! [X7,X8] : a_truth(implies(X7,implies(X8,X7)))
& ! [X9,X10,X11] : a_truth(implies(implies(X9,implies(X10,X11)),implies(implies(X9,X10),implies(X9,X11))))
& ! [X12,X13] : a_truth(implies(implies(not(X12),not(X13)),implies(X13,X12)))
& ~ a_truth(implies(esk1_0,esk1_0)) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X5,X6,X7,X8,X9,X10,X11,X12,X13] :
( a_truth(implies(implies(not(X12),not(X13)),implies(X13,X12)))
& a_truth(implies(implies(X9,implies(X10,X11)),implies(implies(X9,X10),implies(X9,X11))))
& a_truth(implies(X7,implies(X8,X7)))
& ( ~ a_truth(implies(X5,X6))
| ~ a_truth(X5)
| a_truth(X6) )
& ~ a_truth(implies(esk1_0,esk1_0)) ),
inference(shift_quantors,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
~ a_truth(implies(esk1_0,esk1_0)),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( a_truth(X1)
| ~ a_truth(X2)
| ~ a_truth(implies(X2,X1)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
a_truth(implies(X1,implies(X2,X1))),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(15,negated_conjecture,
( a_truth(implies(implies(X1,X2),implies(X1,X3)))
| ~ a_truth(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[9,11,theory(equality)]) ).
cnf(24,negated_conjecture,
( a_truth(implies(X1,X2))
| ~ a_truth(implies(X1,X3))
| ~ a_truth(implies(X1,implies(X3,X2))) ),
inference(spm,[status(thm)],[9,15,theory(equality)]) ).
cnf(27,negated_conjecture,
( a_truth(implies(X1,X1))
| ~ a_truth(implies(X1,X2)) ),
inference(spm,[status(thm)],[24,10,theory(equality)]) ).
cnf(38,negated_conjecture,
a_truth(implies(X1,X1)),
inference(spm,[status(thm)],[27,10,theory(equality)]) ).
cnf(50,negated_conjecture,
$false,
inference(rw,[status(thm)],[8,38,theory(equality)]) ).
cnf(51,negated_conjecture,
$false,
inference(cn,[status(thm)],[50,theory(equality)]) ).
cnf(52,negated_conjecture,
$false,
51,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL414+1.p
% --creating new selector for []
% -running prover on /tmp/tmp6F8Bbj/sel_LCL414+1.p_1 with time limit 29
% -prover status Theorem
% Problem LCL414+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL414+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL414+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
%
%------------------------------------------------------------------------------