TSTP Solution File: LCL684+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL684+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 : art07.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:42:49 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 92 ( 49 ~; 29 |; 14 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 16 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( p201(X1)
& p101(X1) ) ) )
| ~ ( p201(X1)
& p101(X1) ) ),
file('/tmp/tmpXR9F3w/sel_LCL684+1.001.p_1',main) ).
fof(3,axiom,
! [X1] : r1(X1,X1),
file('/tmp/tmpXR9F3w/sel_LCL684+1.001.p_1',reflexivity) ).
fof(4,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( p201(X1)
& p101(X1) ) ) )
| ~ ( p201(X1)
& p101(X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(5,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( p201(X1)
& p101(X1) ) ) )
| ~ ( p201(X1)
& p101(X1) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(6,negated_conjecture,
? [X1] :
( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p201(X1)
| ~ p101(X1) ) )
& p201(X1)
& p101(X1) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(7,negated_conjecture,
? [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| ! [X5] :
( ~ r1(X4,X5)
| ~ p201(X5)
| ~ p101(X5) ) )
& p201(X3)
& p101(X3) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(8,negated_conjecture,
( ! [X4] :
( ~ r1(esk1_0,X4)
| ! [X5] :
( ~ r1(X4,X5)
| ~ p201(X5)
| ~ p101(X5) ) )
& p201(esk1_0)
& p101(esk1_0) ),
inference(skolemize,[status(esa)],[7]) ).
fof(9,negated_conjecture,
! [X4,X5] :
( ( ~ r1(X4,X5)
| ~ p201(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X4) )
& p201(esk1_0)
& p101(esk1_0) ),
inference(shift_quantors,[status(thm)],[8]) ).
cnf(10,negated_conjecture,
p101(esk1_0),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(11,negated_conjecture,
p201(esk1_0),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(12,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(16,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[3]) ).
cnf(17,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(19,negated_conjecture,
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[12,17,theory(equality)]) ).
cnf(20,negated_conjecture,
( ~ p201(esk1_0)
| ~ r1(esk1_0,esk1_0) ),
inference(spm,[status(thm)],[19,10,theory(equality)]) ).
cnf(21,negated_conjecture,
( $false
| ~ r1(esk1_0,esk1_0) ),
inference(rw,[status(thm)],[20,11,theory(equality)]) ).
cnf(22,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[21,17,theory(equality)]) ).
cnf(23,negated_conjecture,
$false,
inference(cn,[status(thm)],[22,theory(equality)]) ).
cnf(24,negated_conjecture,
$false,
23,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL684+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmpXR9F3w/sel_LCL684+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL684+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL684+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL684+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
%
%------------------------------------------------------------------------------