TSTP Solution File: RNG044+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG044+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 01:46:43 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 107 ( 24 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 128 ( 59 ~; 57 |; 10 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
( aScalar0(xx)
& aScalar0(xy)
& aScalar0(xu)
& aScalar0(xv) ),
file('/tmp/tmps8tVzN/sel_RNG044+1.p_1',m__674) ).
fof(12,axiom,
! [X1,X2,X3] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)) ) ),
file('/tmp/tmps8tVzN/sel_RNG044+1.p_1',mDistr) ).
fof(13,conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
file('/tmp/tmps8tVzN/sel_RNG044+1.p_1',m__) ).
fof(14,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/tmp/tmps8tVzN/sel_RNG044+1.p_1',mSumSc) ).
fof(18,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(assume_negation,[status(cth)],[13]) ).
fof(19,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
cnf(58,plain,
aScalar0(xv),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(59,plain,
aScalar0(xu),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(60,plain,
aScalar0(xy),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(61,plain,
aScalar0(xx),
inference(split_conjunct,[status(thm)],[10]) ).
fof(65,plain,
! [X1,X2,X3] :
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(66,plain,
! [X4,X5,X6] :
( ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6)
| ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
& sdtasdt0(sdtpldt0(X4,X5),X6) = sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6)) ) ),
inference(variable_rename,[status(thm)],[65]) ).
fof(67,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) )
& ( sdtasdt0(sdtpldt0(X4,X5),X6) = sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ aScalar0(X6) ) ),
inference(distribute,[status(thm)],[66]) ).
cnf(68,plain,
( sdtasdt0(sdtpldt0(X3,X2),X1) = sdtpldt0(sdtasdt0(X3,X1),sdtasdt0(X2,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(69,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(70,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(split_conjunct,[status(thm)],[19]) ).
fof(71,plain,
! [X1,X2] :
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| aScalar0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(72,plain,
! [X3,X4] :
( ~ aScalar0(X3)
| ~ aScalar0(X4)
| aScalar0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[71]) ).
cnf(73,plain,
( aScalar0(sdtpldt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(206,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| ~ aScalar0(xx)
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(spm,[status(thm)],[70,69,theory(equality)]) ).
cnf(222,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| $false
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(rw,[status(thm)],[206,61,theory(equality)]) ).
cnf(223,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| $false
| $false
| ~ aScalar0(xv) ),
inference(rw,[status(thm)],[222,59,theory(equality)]) ).
cnf(224,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| $false
| $false
| $false ),
inference(rw,[status(thm)],[223,58,theory(equality)]) ).
cnf(225,negated_conjecture,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cn,[status(thm)],[224,theory(equality)]) ).
cnf(261,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| ~ aScalar0(xy)
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(spm,[status(thm)],[225,69,theory(equality)]) ).
cnf(262,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| $false
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(rw,[status(thm)],[261,60,theory(equality)]) ).
cnf(263,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| $false
| $false
| ~ aScalar0(xv) ),
inference(rw,[status(thm)],[262,59,theory(equality)]) ).
cnf(264,negated_conjecture,
( sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))
| $false
| $false
| $false ),
inference(rw,[status(thm)],[263,58,theory(equality)]) ).
cnf(265,negated_conjecture,
sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cn,[status(thm)],[264,theory(equality)]) ).
cnf(283,negated_conjecture,
( ~ aScalar0(xx)
| ~ aScalar0(xy)
| ~ aScalar0(sdtpldt0(xu,xv)) ),
inference(spm,[status(thm)],[265,68,theory(equality)]) ).
cnf(284,negated_conjecture,
( $false
| ~ aScalar0(xy)
| ~ aScalar0(sdtpldt0(xu,xv)) ),
inference(rw,[status(thm)],[283,61,theory(equality)]) ).
cnf(285,negated_conjecture,
( $false
| $false
| ~ aScalar0(sdtpldt0(xu,xv)) ),
inference(rw,[status(thm)],[284,60,theory(equality)]) ).
cnf(286,negated_conjecture,
~ aScalar0(sdtpldt0(xu,xv)),
inference(cn,[status(thm)],[285,theory(equality)]) ).
cnf(287,negated_conjecture,
( ~ aScalar0(xv)
| ~ aScalar0(xu) ),
inference(spm,[status(thm)],[286,73,theory(equality)]) ).
cnf(288,negated_conjecture,
( $false
| ~ aScalar0(xu) ),
inference(rw,[status(thm)],[287,58,theory(equality)]) ).
cnf(289,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[288,59,theory(equality)]) ).
cnf(290,negated_conjecture,
$false,
inference(cn,[status(thm)],[289,theory(equality)]) ).
cnf(291,negated_conjecture,
$false,
290,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG044+1.p
% --creating new selector for []
% -running prover on /tmp/tmps8tVzN/sel_RNG044+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG044+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG044+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG044+1.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
%
%------------------------------------------------------------------------------