TSTP Solution File: RNG045+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG045+1 : 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 : Sun Dec 26 01:46:47 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 80 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 91 ( 39 ~; 42 |; 9 &)
% ( 0 <=>; 1 =>; 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 : 15 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
( aScalar0(xx)
& aScalar0(xy)
& aScalar0(xu)
& aScalar0(xv) ),
file('/tmp/tmpHFmniQ/sel_RNG045+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/tmpHFmniQ/sel_RNG045+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/tmpHFmniQ/sel_RNG045+1.p_1',m__) ).
fof(18,axiom,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
file('/tmp/tmpHFmniQ/sel_RNG045+1.p_1',m__733) ).
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(assume_negation,[status(cth)],[13]) ).
fof(20,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)],[19,theory(equality)]) ).
cnf(59,plain,
aScalar0(xv),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(60,plain,
aScalar0(xu),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(61,plain,
aScalar0(xy),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(62,plain,
aScalar0(xx),
inference(split_conjunct,[status(thm)],[10]) ).
fof(66,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(67,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)],[66]) ).
fof(68,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)],[67]) ).
cnf(70,plain,
( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(71,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)],[20]) ).
cnf(86,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(242,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)],[71,70,theory(equality)]) ).
cnf(258,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)],[242,62,theory(equality)]) ).
cnf(259,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)],[258,60,theory(equality)]) ).
cnf(260,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)],[259,59,theory(equality)]) ).
cnf(261,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)],[260,theory(equality)]) ).
cnf(318,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)],[261,70,theory(equality)]) ).
cnf(331,negated_conjecture,
( $false
| ~ aScalar0(xy)
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(rw,[status(thm)],[318,86,theory(equality)]) ).
cnf(332,negated_conjecture,
( $false
| $false
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(rw,[status(thm)],[331,61,theory(equality)]) ).
cnf(333,negated_conjecture,
( $false
| $false
| $false
| ~ aScalar0(xv) ),
inference(rw,[status(thm)],[332,60,theory(equality)]) ).
cnf(334,negated_conjecture,
( $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[333,59,theory(equality)]) ).
cnf(335,negated_conjecture,
$false,
inference(cn,[status(thm)],[334,theory(equality)]) ).
cnf(336,negated_conjecture,
$false,
335,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG045+1.p
% --creating new selector for []
% -running prover on /tmp/tmpHFmniQ/sel_RNG045+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG045+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG045+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG045+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
%
%------------------------------------------------------------------------------