TSTP Solution File: CSR031+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR031+3 : TPTP v5.0.0. Released v3.4.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 06:05:35 EST 2010
% Result : Theorem 1.30s
% Output : CNFRefutation 1.30s
% 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(1,axiom,
! [X1,X2] :
( disjointwith(X1,X2)
=> collection(X2) ),
file('/tmp/tmpHSqY9n/sel_CSR031+3.p_1',ax2_2921) ).
fof(6,axiom,
! [X4] :
~ ( collection(X4)
& individual(X4) ),
file('/tmp/tmpHSqY9n/sel_CSR031+3.p_1',ax2_3226) ).
fof(23,axiom,
individual(c_tptptptpcol_16_8398),
file('/tmp/tmpHSqY9n/sel_CSR031+3.p_1',ax2_2816) ).
fof(28,axiom,
! [X3,X8] :
( disjointwith(X3,X8)
=> disjointwith(X8,X3) ),
file('/tmp/tmpHSqY9n/sel_CSR031+3.p_1',ax2_7584) ).
fof(44,conjecture,
~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
file('/tmp/tmpHSqY9n/sel_CSR031+3.p_1',query131) ).
fof(45,negated_conjecture,
~ ~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
inference(assume_negation,[status(cth)],[44]) ).
fof(46,negated_conjecture,
disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
inference(fof_simplification,[status(thm)],[45,theory(equality)]) ).
fof(47,plain,
! [X1,X2] :
( ~ disjointwith(X1,X2)
| collection(X2) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(48,plain,
! [X3,X4] :
( ~ disjointwith(X3,X4)
| collection(X4) ),
inference(variable_rename,[status(thm)],[47]) ).
cnf(49,plain,
( collection(X1)
| ~ disjointwith(X2,X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(62,plain,
! [X4] :
( ~ collection(X4)
| ~ individual(X4) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(63,plain,
! [X5] :
( ~ collection(X5)
| ~ individual(X5) ),
inference(variable_rename,[status(thm)],[62]) ).
cnf(64,plain,
( ~ individual(X1)
| ~ collection(X1) ),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(106,plain,
individual(c_tptptptpcol_16_8398),
inference(split_conjunct,[status(thm)],[23]) ).
fof(119,plain,
! [X3,X8] :
( ~ disjointwith(X3,X8)
| disjointwith(X8,X3) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(120,plain,
! [X9,X10] :
( ~ disjointwith(X9,X10)
| disjointwith(X10,X9) ),
inference(variable_rename,[status(thm)],[119]) ).
cnf(121,plain,
( disjointwith(X1,X2)
| ~ disjointwith(X2,X1) ),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(163,negated_conjecture,
disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
inference(split_conjunct,[status(thm)],[46]) ).
cnf(167,plain,
~ collection(c_tptptptpcol_16_8398),
inference(spm,[status(thm)],[64,106,theory(equality)]) ).
cnf(168,negated_conjecture,
disjointwith(c_tptpcol_16_18488,c_tptptptpcol_16_8398),
inference(spm,[status(thm)],[121,163,theory(equality)]) ).
cnf(189,negated_conjecture,
collection(c_tptptptpcol_16_8398),
inference(spm,[status(thm)],[49,168,theory(equality)]) ).
cnf(192,negated_conjecture,
$false,
inference(sr,[status(thm)],[189,167,theory(equality)]) ).
cnf(193,negated_conjecture,
$false,
192,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR031+3.p
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmpHSqY9n/sel_CSR031+3.p_1 with time limit 29
% -prover status Theorem
% Problem CSR031+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR031+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR031+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
%
%------------------------------------------------------------------------------