TSTP Solution File: LCL678+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL678+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 : 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 20:26:38 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 138 ( 68 ~; 50 |; 20 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 1 sgn 24 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ~ $true
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ $true
| ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) ),
file('/tmp/tmpAK9-Fv/sel_LCL678+1.001.p_1',main) ).
fof(3,axiom,
! [X1] : r1(X1,X1),
file('/tmp/tmpAK9-Fv/sel_LCL678+1.001.p_1',reflexivity) ).
fof(4,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ $true
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ $true
| ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(5,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ $true
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ $true
| ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(6,negated_conjecture,
? [X1] :
( $true
& ! [X2] :
( ~ r1(X1,X2)
| ~ $true
| ? [X1] :
( r1(X2,X1)
& ? [X2] :
( r1(X1,X2)
& ~ p1(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(7,negated_conjecture,
? [X3] :
( $true
& ! [X4] :
( ~ r1(X3,X4)
| ~ $true
| ? [X5] :
( r1(X4,X5)
& ? [X6] :
( r1(X5,X6)
& ~ p1(X6) )
& ! [X7] :
( ~ r1(X5,X7)
| p1(X7) ) ) ) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(8,negated_conjecture,
( $true
& ! [X4] :
( ~ r1(esk1_0,X4)
| ~ $true
| ( r1(X4,esk2_1(X4))
& r1(esk2_1(X4),esk3_1(X4))
& ~ p1(esk3_1(X4))
& ! [X7] :
( ~ r1(esk2_1(X4),X7)
| p1(X7) ) ) ) ),
inference(skolemize,[status(esa)],[7]) ).
fof(9,negated_conjecture,
! [X4,X7] :
( ( ( ( ~ r1(esk2_1(X4),X7)
| p1(X7) )
& r1(X4,esk2_1(X4))
& r1(esk2_1(X4),esk3_1(X4))
& ~ p1(esk3_1(X4)) )
| ~ r1(esk1_0,X4)
| ~ $true )
& $true ),
inference(shift_quantors,[status(thm)],[8]) ).
fof(10,negated_conjecture,
! [X4,X7] :
( ( ~ r1(esk2_1(X4),X7)
| p1(X7)
| ~ r1(esk1_0,X4)
| ~ $true )
& ( r1(X4,esk2_1(X4))
| ~ r1(esk1_0,X4)
| ~ $true )
& ( r1(esk2_1(X4),esk3_1(X4))
| ~ r1(esk1_0,X4)
| ~ $true )
& ( ~ p1(esk3_1(X4))
| ~ r1(esk1_0,X4)
| ~ $true )
& $true ),
inference(distribute,[status(thm)],[9]) ).
cnf(12,negated_conjecture,
( $false
| ~ r1(esk1_0,X1)
| ~ p1(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(13,negated_conjecture,
( r1(esk2_1(X1),esk3_1(X1))
| $false
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(15,negated_conjecture,
( p1(X2)
| $false
| ~ r1(esk1_0,X1)
| ~ r1(esk2_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(19,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[3]) ).
cnf(20,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(23,negated_conjecture,
( p1(esk3_1(X1))
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[15,13,theory(equality)]) ).
cnf(27,negated_conjecture,
~ r1(esk1_0,X1),
inference(csr,[status(thm)],[23,12]) ).
cnf(28,negated_conjecture,
$false,
inference(spm,[status(thm)],[27,20,theory(equality)]) ).
cnf(30,negated_conjecture,
$false,
28,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL678+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmpAK9-Fv/sel_LCL678+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL678+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL678+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL678+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
%
%------------------------------------------------------------------------------