%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR055+1 : TPTP v5.0.0. Released v3.4.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 : Sat Dec 25 06:28:18 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 29 ( 17 ~; 9 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 1 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(24,axiom,
individual(c_xskijump_thegame),
file('/tmp/tmpZziBXJ/sel_CSR055+1.p_1',just1) ).
fof(27,axiom,
! [X11] :
~ ( collection(X11)
& individual(X11) ),
file('/tmp/tmpZziBXJ/sel_CSR055+1.p_1',just5) ).
fof(36,axiom,
! [X1,X5] :
( disjointwith(X1,X5)
=> collection(X5) ),
file('/tmp/tmpZziBXJ/sel_CSR055+1.p_1',just10) ).
fof(45,conjecture,
~ disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
file('/tmp/tmpZziBXJ/sel_CSR055+1.p_1',query55) ).
fof(48,axiom,
! [X8,X9] :
( disjointwith(X8,X9)
=> disjointwith(X9,X8) ),
file('/tmp/tmpZziBXJ/sel_CSR055+1.p_1',just33) ).
fof(57,negated_conjecture,
~ ~ disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(assume_negation,[status(cth)],[45]) ).
fof(58,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(fof_simplification,[status(thm)],[57,theory(equality)]) ).
cnf(122,plain,
individual(c_xskijump_thegame),
inference(split_conjunct,[status(thm)],[24]) ).
fof(127,plain,
! [X11] :
( ~ collection(X11)
| ~ individual(X11) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(128,plain,
! [X12] :
( ~ collection(X12)
| ~ individual(X12) ),
inference(variable_rename,[status(thm)],[127]) ).
cnf(129,plain,
( ~ individual(X1)
| ~ collection(X1) ),
inference(split_conjunct,[status(thm)],[128]) ).
fof(150,plain,
! [X1,X5] :
( ~ disjointwith(X1,X5)
| collection(X5) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(151,plain,
! [X6,X7] :
( ~ disjointwith(X6,X7)
| collection(X7) ),
inference(variable_rename,[status(thm)],[150]) ).
cnf(152,plain,
( collection(X1)
| ~ disjointwith(X2,X1) ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(175,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(split_conjunct,[status(thm)],[58]) ).
fof(182,plain,
! [X8,X9] :
( ~ disjointwith(X8,X9)
| disjointwith(X9,X8) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(183,plain,
! [X10,X11] :
( ~ disjointwith(X10,X11)
| disjointwith(X11,X10) ),
inference(variable_rename,[status(thm)],[182]) ).
cnf(184,plain,
( disjointwith(X1,X2)
| ~ disjointwith(X2,X1) ),
inference(split_conjunct,[status(thm)],[183]) ).
cnf(205,negated_conjecture,
disjointwith(c_tptpcol_16_35301,c_xskijump_thegame),
inference(spm,[status(thm)],[184,175,theory(equality)]) ).
cnf(211,plain,
~ collection(c_xskijump_thegame),
inference(spm,[status(thm)],[129,122,theory(equality)]) ).
cnf(238,negated_conjecture,
collection(c_xskijump_thegame),
inference(spm,[status(thm)],[152,205,theory(equality)]) ).
cnf(242,negated_conjecture,
$false,
inference(sr,[status(thm)],[238,211,theory(equality)]) ).
cnf(243,negated_conjecture,
$false,
242,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR055+1.p
% --creating new selector for [CSR002+0.ax]
% -running prover on /tmp/tmpZziBXJ/sel_CSR055+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR055+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR055+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR055+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
%
%------------------------------------------------------------------------------