TSTP Solution File: LCL686+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL686+1.001 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 20:47:56 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 221 ( 0 equ)
% Maximal formula atoms : 29 ( 6 avg)
% Number of connectives : 328 ( 139 ~; 112 |; 77 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 66 ( 0 sgn 36 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ $true )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
file('/tmp/tmpPvlbUX/sel_LCL686+1.001.p_1',main) ).
fof(3,axiom,
! [X1] : r1(X1,X1),
file('/tmp/tmpPvlbUX/sel_LCL686+1.001.p_1',reflexivity) ).
fof(4,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ $true )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(5,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ $true )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(6,negated_conjecture,
? [X1] :
( ? [X2] :
( r1(X1,X2)
& p3(X2)
& ? [X1] :
( r1(X2,X1)
& p1(X1) ) )
& ? [X2] :
( r1(X1,X2)
& ! [X1] :
( ~ r1(X2,X1)
| ( ? [X2] :
( r1(X1,X2)
& $true )
& ! [X2] :
( ~ r1(X1,X2)
| ( ( ~ p2(X2)
| p1(X2) )
& ( p2(X2)
| ~ p1(X2) ) ) )
& ? [X2] :
( r1(X1,X2)
& ~ p3(X2) )
& ? [X2] :
( r1(X1,X2)
& ( p1(X2)
| p2(X2) )
& ( ~ p2(X2)
| ~ p1(X2) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(7,negated_conjecture,
? [X3] :
( ? [X4] :
( r1(X3,X4)
& p3(X4)
& ? [X5] :
( r1(X4,X5)
& p1(X5) ) )
& ? [X6] :
( r1(X3,X6)
& ! [X7] :
( ~ r1(X6,X7)
| ( ? [X8] :
( r1(X7,X8)
& $true )
& ! [X9] :
( ~ r1(X7,X9)
| ( ( ~ p2(X9)
| p1(X9) )
& ( p2(X9)
| ~ p1(X9) ) ) )
& ? [X10] :
( r1(X7,X10)
& ~ p3(X10) )
& ? [X11] :
( r1(X7,X11)
& ( p1(X11)
| p2(X11) )
& ( ~ p2(X11)
| ~ p1(X11) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(8,negated_conjecture,
( r1(esk1_0,esk2_0)
& p3(esk2_0)
& r1(esk2_0,esk3_0)
& p1(esk3_0)
& r1(esk1_0,esk4_0)
& ! [X7] :
( ~ r1(esk4_0,X7)
| ( r1(X7,esk5_1(X7))
& $true
& ! [X9] :
( ~ r1(X7,X9)
| ( ( ~ p2(X9)
| p1(X9) )
& ( p2(X9)
| ~ p1(X9) ) ) )
& r1(X7,esk6_1(X7))
& ~ p3(esk6_1(X7))
& r1(X7,esk7_1(X7))
& ( p1(esk7_1(X7))
| p2(esk7_1(X7)) )
& ( ~ p2(esk7_1(X7))
| ~ p1(esk7_1(X7)) ) ) ) ),
inference(skolemize,[status(esa)],[7]) ).
fof(9,negated_conjecture,
! [X7,X9] :
( ( ( ( ~ r1(X7,X9)
| ( ( ~ p2(X9)
| p1(X9) )
& ( p2(X9)
| ~ p1(X9) ) ) )
& r1(X7,esk5_1(X7))
& $true
& r1(X7,esk6_1(X7))
& ~ p3(esk6_1(X7))
& r1(X7,esk7_1(X7))
& ( p1(esk7_1(X7))
| p2(esk7_1(X7)) )
& ( ~ p2(esk7_1(X7))
| ~ p1(esk7_1(X7)) ) )
| ~ r1(esk4_0,X7) )
& r1(esk1_0,esk4_0)
& r1(esk1_0,esk2_0)
& p3(esk2_0)
& r1(esk2_0,esk3_0)
& p1(esk3_0) ),
inference(shift_quantors,[status(thm)],[8]) ).
fof(10,negated_conjecture,
! [X7,X9] :
( ( ~ p2(X9)
| p1(X9)
| ~ r1(X7,X9)
| ~ r1(esk4_0,X7) )
& ( p2(X9)
| ~ p1(X9)
| ~ r1(X7,X9)
| ~ r1(esk4_0,X7) )
& ( r1(X7,esk5_1(X7))
| ~ r1(esk4_0,X7) )
& ( $true
| ~ r1(esk4_0,X7) )
& ( r1(X7,esk6_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p3(esk6_1(X7))
| ~ r1(esk4_0,X7) )
& ( r1(X7,esk7_1(X7))
| ~ r1(esk4_0,X7) )
& ( p1(esk7_1(X7))
| p2(esk7_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p2(esk7_1(X7))
| ~ p1(esk7_1(X7))
| ~ r1(esk4_0,X7) )
& r1(esk1_0,esk4_0)
& r1(esk1_0,esk2_0)
& p3(esk2_0)
& r1(esk2_0,esk3_0)
& p1(esk3_0) ),
inference(distribute,[status(thm)],[9]) ).
cnf(16,negated_conjecture,
( ~ r1(esk4_0,X1)
| ~ p1(esk7_1(X1))
| ~ p2(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(17,negated_conjecture,
( p2(esk7_1(X1))
| p1(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(18,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(23,negated_conjecture,
( p2(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p1(X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(24,negated_conjecture,
( p1(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p2(X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(28,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[3]) ).
cnf(29,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(41,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(esk7_1(esk4_0),X1)
| ~ r1(esk4_0,esk4_0) ),
inference(spm,[status(thm)],[24,18,theory(equality)]) ).
cnf(46,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(esk7_1(esk4_0),X1)
| $false ),
inference(rw,[status(thm)],[41,29,theory(equality)]) ).
cnf(47,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(esk7_1(esk4_0),X1) ),
inference(cn,[status(thm)],[46,theory(equality)]) ).
cnf(48,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[23,29,theory(equality)]) ).
cnf(66,negated_conjecture,
( ~ p1(esk7_1(X1))
| ~ r1(esk4_0,X1)
| ~ r1(esk4_0,esk7_1(X1)) ),
inference(spm,[status(thm)],[16,48,theory(equality)]) ).
cnf(82,negated_conjecture,
( p1(esk7_1(esk4_0))
| ~ p2(esk7_1(esk4_0)) ),
inference(spm,[status(thm)],[47,29,theory(equality)]) ).
cnf(94,negated_conjecture,
( p1(esk7_1(esk4_0))
| ~ r1(esk4_0,esk4_0) ),
inference(spm,[status(thm)],[82,17,theory(equality)]) ).
cnf(96,negated_conjecture,
( p1(esk7_1(esk4_0))
| $false ),
inference(rw,[status(thm)],[94,29,theory(equality)]) ).
cnf(97,negated_conjecture,
p1(esk7_1(esk4_0)),
inference(cn,[status(thm)],[96,theory(equality)]) ).
cnf(98,negated_conjecture,
( ~ r1(esk4_0,esk7_1(esk4_0))
| ~ r1(esk4_0,esk4_0) ),
inference(spm,[status(thm)],[66,97,theory(equality)]) ).
cnf(100,negated_conjecture,
( ~ r1(esk4_0,esk7_1(esk4_0))
| $false ),
inference(rw,[status(thm)],[98,29,theory(equality)]) ).
cnf(101,negated_conjecture,
~ r1(esk4_0,esk7_1(esk4_0)),
inference(cn,[status(thm)],[100,theory(equality)]) ).
cnf(102,negated_conjecture,
~ r1(esk4_0,esk4_0),
inference(spm,[status(thm)],[101,18,theory(equality)]) ).
cnf(103,negated_conjecture,
$false,
inference(rw,[status(thm)],[102,29,theory(equality)]) ).
cnf(104,negated_conjecture,
$false,
inference(cn,[status(thm)],[103,theory(equality)]) ).
cnf(105,negated_conjecture,
$false,
104,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL686+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmpPvlbUX/sel_LCL686+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL686+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL686+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL686+1.001.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
%
%------------------------------------------------------------------------------