TSTP Solution File: SYN393+1.003 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN393+1.003 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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 13:19:22 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 28 ( 5 unt; 0 def)
% Number of atoms : 325 ( 0 equ)
% Maximal formula atoms : 192 ( 11 avg)
% Number of connectives : 445 ( 148 ~; 243 |; 44 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 38 ( 5 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
file('/tmp/tmpT4qlkX/sel_SYN393+1.003.p_1',pel12) ).
fof(2,negated_conjecture,
~ ( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ( ( ( ( ~ p1
| ~ p2 )
& ( p1
| p2 ) )
| ~ p3 )
& ( ( ( ~ p1
| p2 )
& ( ~ p2
| p1 ) )
| p3 ) )
| ( ( ~ p1
| ( ( ~ p2
| ~ p3 )
& ( p2
| p3 ) ) )
& ( p1
| ( ( ~ p2
| p3 )
& ( ~ p3
| p2 ) ) ) ) )
& ( ( ( ( ( ~ p1
| ~ p2 )
& ( p1
| p2 ) )
| p3 )
& ( ~ p3
| ( ( ~ p1
| p2 )
& ( ~ p2
| p1 ) ) ) )
| ( ( ~ p1
| ( ( ~ p2
| p3 )
& ( ~ p3
| p2 ) ) )
& ( ( ( ~ p2
| ~ p3 )
& ( p2
| p3 ) )
| p1 ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( ~ p2
| ~ p3
| ~ p1
| ~ p1
| ~ p2
| ~ p3 )
& ( p2
| p3
| ~ p1
| ~ p1
| ~ p2
| ~ p3 )
& ( ~ p2
| p3
| p1
| ~ p1
| ~ p2
| ~ p3 )
& ( ~ p3
| p2
| p1
| ~ p1
| ~ p2
| ~ p3 )
& ( ~ p2
| ~ p3
| ~ p1
| p1
| p2
| ~ p3 )
& ( p2
| p3
| ~ p1
| p1
| p2
| ~ p3 )
& ( ~ p2
| p3
| p1
| p1
| p2
| ~ p3 )
& ( ~ p3
| p2
| p1
| p1
| p2
| ~ p3 )
& ( ~ p2
| ~ p3
| ~ p1
| ~ p1
| p2
| p3 )
& ( p2
| p3
| ~ p1
| ~ p1
| p2
| p3 )
& ( ~ p2
| p3
| p1
| ~ p1
| p2
| p3 )
& ( ~ p3
| p2
| p1
| ~ p1
| p2
| p3 )
& ( ~ p2
| ~ p3
| ~ p1
| ~ p2
| p1
| p3 )
& ( p2
| p3
| ~ p1
| ~ p2
| p1
| p3 )
& ( ~ p2
| p3
| p1
| ~ p2
| p1
| p3 )
& ( ~ p3
| p2
| p1
| ~ p2
| p1
| p3 )
& ( ~ p2
| p3
| ~ p1
| ~ p1
| ~ p2
| p3 )
& ( ~ p3
| p2
| ~ p1
| ~ p1
| ~ p2
| p3 )
& ( ~ p2
| ~ p3
| p1
| ~ p1
| ~ p2
| p3 )
& ( p2
| p3
| p1
| ~ p1
| ~ p2
| p3 )
& ( ~ p2
| p3
| ~ p1
| p1
| p2
| p3 )
& ( ~ p3
| p2
| ~ p1
| p1
| p2
| p3 )
& ( ~ p2
| ~ p3
| p1
| p1
| p2
| p3 )
& ( p2
| p3
| p1
| p1
| p2
| p3 )
& ( ~ p2
| p3
| ~ p1
| ~ p1
| p2
| ~ p3 )
& ( ~ p3
| p2
| ~ p1
| ~ p1
| p2
| ~ p3 )
& ( ~ p2
| ~ p3
| p1
| ~ p1
| p2
| ~ p3 )
& ( p2
| p3
| p1
| ~ p1
| p2
| ~ p3 )
& ( ~ p2
| p3
| ~ p1
| ~ p2
| p1
| ~ p3 )
& ( ~ p3
| p2
| ~ p1
| ~ p2
| p1
| ~ p3 )
& ( ~ p2
| ~ p3
| p1
| ~ p2
| p1
| ~ p3 )
& ( p2
| p3
| p1
| ~ p2
| p1
| ~ p3 ) ),
inference(distribute,[status(thm)],[3]) ).
cnf(6,negated_conjecture,
( p1
| p1
| ~ p3
| ~ p2
| ~ p3
| ~ p2 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(11,negated_conjecture,
( p2
| p2
| ~ p3
| ~ p1
| ~ p1
| ~ p3 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(13,negated_conjecture,
( p3
| p2
| p1
| p1
| p3
| p2 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(20,negated_conjecture,
( p3
| p3
| ~ p2
| ~ p1
| ~ p1
| ~ p2 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(22,negated_conjecture,
( p3
| p1
| p1
| p3
| ~ p2
| ~ p2 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(27,negated_conjecture,
( p3
| p2
| p3
| p2
| ~ p1
| ~ p1 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(29,negated_conjecture,
( p2
| p1
| p1
| p2
| ~ p3
| ~ p3 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(36,negated_conjecture,
( ~ p3
| ~ p2
| ~ p1
| ~ p1
| ~ p3
| ~ p2 ),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(37,negated_conjecture,
( p2
| p1 ),
inference(csr,[status(thm)],[29,13]) ).
cnf(38,negated_conjecture,
( p3
| p1 ),
inference(csr,[status(thm)],[22,37]) ).
cnf(39,negated_conjecture,
( p3
| p2 ),
inference(csr,[status(thm)],[27,37]) ).
cnf(40,negated_conjecture,
( p1
| ~ p2 ),
inference(csr,[status(thm)],[6,38]) ).
cnf(41,negated_conjecture,
p1,
inference(csr,[status(thm)],[40,37]) ).
cnf(44,negated_conjecture,
( p2
| $false
| ~ p3 ),
inference(rw,[status(thm)],[11,41,theory(equality)]) ).
cnf(45,negated_conjecture,
( p2
| ~ p3 ),
inference(cn,[status(thm)],[44,theory(equality)]) ).
cnf(46,negated_conjecture,
p2,
inference(csr,[status(thm)],[45,39]) ).
cnf(48,negated_conjecture,
( p3
| $false
| ~ p2 ),
inference(rw,[status(thm)],[20,41,theory(equality)]) ).
cnf(49,negated_conjecture,
( p3
| $false
| $false ),
inference(rw,[status(thm)],[48,46,theory(equality)]) ).
cnf(50,negated_conjecture,
p3,
inference(cn,[status(thm)],[49,theory(equality)]) ).
cnf(51,negated_conjecture,
( $false
| ~ p2
| ~ p3 ),
inference(rw,[status(thm)],[36,41,theory(equality)]) ).
cnf(52,negated_conjecture,
( $false
| $false
| ~ p3 ),
inference(rw,[status(thm)],[51,46,theory(equality)]) ).
cnf(53,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[52,50,theory(equality)]) ).
cnf(54,negated_conjecture,
$false,
inference(cn,[status(thm)],[53,theory(equality)]) ).
cnf(55,negated_conjecture,
$false,
54,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN393+1.003.p
% --creating new selector for []
% -running prover on /tmp/tmpT4qlkX/sel_SYN393+1.003.p_1 with time limit 29
% -prover status Theorem
% Problem SYN393+1.003.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN393+1.003.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN393+1.003.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
%
%------------------------------------------------------------------------------