%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET599+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 03:00:10 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 3 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 1 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
file('/tmp/tmpLDzgER/sel_SET599+3.p_1',symmetric_difference_defn) ).
fof(4,conjecture,
! [X1,X2] : subset(difference(X1,X2),symmetric_difference(X1,X2)),
file('/tmp/tmpLDzgER/sel_SET599+3.p_1',prove_th58) ).
fof(9,axiom,
! [X1,X2] : subset(X1,union(X1,X2)),
file('/tmp/tmpLDzgER/sel_SET599+3.p_1',subset_of_union) ).
fof(10,negated_conjecture,
~ ! [X1,X2] : subset(difference(X1,X2),symmetric_difference(X1,X2)),
inference(assume_negation,[status(cth)],[4]) ).
fof(16,plain,
! [X3,X4] : symmetric_difference(X3,X4) = union(difference(X3,X4),difference(X4,X3)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(17,plain,
symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
inference(split_conjunct,[status(thm)],[16]) ).
fof(18,negated_conjecture,
? [X1,X2] : ~ subset(difference(X1,X2),symmetric_difference(X1,X2)),
inference(fof_nnf,[status(thm)],[10]) ).
fof(19,negated_conjecture,
? [X3,X4] : ~ subset(difference(X3,X4),symmetric_difference(X3,X4)),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,negated_conjecture,
~ subset(difference(esk1_0,esk2_0),symmetric_difference(esk1_0,esk2_0)),
inference(skolemize,[status(esa)],[19]) ).
cnf(21,negated_conjecture,
~ subset(difference(esk1_0,esk2_0),symmetric_difference(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[20]) ).
fof(47,plain,
! [X3,X4] : subset(X3,union(X3,X4)),
inference(variable_rename,[status(thm)],[9]) ).
cnf(48,plain,
subset(X1,union(X1,X2)),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(50,negated_conjecture,
~ subset(difference(esk1_0,esk2_0),union(difference(esk1_0,esk2_0),difference(esk2_0,esk1_0))),
inference(rw,[status(thm)],[21,17,theory(equality)]),
[unfolding] ).
cnf(62,negated_conjecture,
$false,
inference(rw,[status(thm)],[50,48,theory(equality)]) ).
cnf(63,negated_conjecture,
$false,
inference(cn,[status(thm)],[62,theory(equality)]) ).
cnf(64,negated_conjecture,
$false,
63,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET599+3.p
% --creating new selector for []
% -running prover on /tmp/tmpLDzgER/sel_SET599+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET599+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET599+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET599+3.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
%
%------------------------------------------------------------------------------