TSTP Solution File: SYN071+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN071+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 13:16:48 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 30 ( 28 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 7 ~; 11 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
( a = b
| c = d ),
file('/tmp/tmpLwN3Kt/sel_SYN071+1.p_1',pel48_1) ).
fof(2,conjecture,
( a = d
| b = c ),
file('/tmp/tmpLwN3Kt/sel_SYN071+1.p_1',pel48) ).
fof(3,axiom,
( a = c
| b = d ),
file('/tmp/tmpLwN3Kt/sel_SYN071+1.p_1',pel48_2) ).
fof(4,negated_conjecture,
~ ( a = d
| b = c ),
inference(assume_negation,[status(cth)],[2]) ).
cnf(5,plain,
( c = d
| a = b ),
inference(split_conjunct,[status(thm)],[1]) ).
fof(6,negated_conjecture,
( a != d
& b != c ),
inference(fof_nnf,[status(thm)],[4]) ).
cnf(7,negated_conjecture,
b != c,
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
a != d,
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,plain,
( b = d
| a = c ),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(10,negated_conjecture,
( c = d
| a != c ),
inference(spm,[status(thm)],[7,5,theory(equality)]) ).
cnf(12,plain,
( c = d
| d = a
| c = a ),
inference(spm,[status(thm)],[5,9,theory(equality)]) ).
cnf(13,plain,
( c = d
| c = a ),
inference(sr,[status(thm)],[12,8,theory(equality)]) ).
cnf(15,negated_conjecture,
c = d,
inference(csr,[status(thm)],[10,13]) ).
cnf(16,negated_conjecture,
b != d,
inference(rw,[status(thm)],[7,15,theory(equality)]) ).
cnf(19,plain,
( b = d
| d = a ),
inference(rw,[status(thm)],[9,15,theory(equality)]) ).
cnf(21,plain,
b = d,
inference(sr,[status(thm)],[19,8,theory(equality)]) ).
cnf(22,plain,
$false,
inference(sr,[status(thm)],[21,16,theory(equality)]) ).
cnf(23,plain,
$false,
22,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN071+1.p
% --creating new selector for []
% -running prover on /tmp/tmpLwN3Kt/sel_SYN071+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN071+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN071+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN071+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
%
%------------------------------------------------------------------------------