TSTP Solution File: RNG074+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG074+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 02:05:58 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 def)
% Number of atoms : 11 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/tmp/tmpXc24SK/sel_RNG074+2.p_1',m__2610) ).
fof(56,axiom,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
file('/tmp/tmpXc24SK/sel_RNG074+2.p_1',m__2590) ).
fof(60,axiom,
sdtpldt0(xR,xS) = sdtpldt0(xP,xP),
file('/tmp/tmpXc24SK/sel_RNG074+2.p_1',m__2679) ).
fof(68,plain,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(fof_simplification,[status(thm)],[56,theory(equality)]) ).
cnf(93,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(236,plain,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(248,plain,
sdtpldt0(xR,xS) = sdtpldt0(xP,xP),
inference(split_conjunct,[status(thm)],[60]) ).
cnf(301,plain,
sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),
inference(rw,[status(thm)],[93,248,theory(equality)]) ).
cnf(330,plain,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[236,248,theory(equality)]),301,theory(equality)]) ).
cnf(331,plain,
$false,
inference(cn,[status(thm)],[330,theory(equality)]) ).
cnf(332,plain,
$false,
331,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG074+2.p
% --creating new selector for []
% -running prover on /tmp/tmpXc24SK/sel_RNG074+2.p_1 with time limit 29
% -prover status Theorem
% Problem RNG074+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG074+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG074+2.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
%
%------------------------------------------------------------------------------