TSTP Solution File: NUM578+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM578+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n046.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:51 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 97 ( 6 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 118 ( 48 ~; 44 |; 17 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,conjecture,
( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ~ equal(szmzizndt0(sdtlpdtrp0(xN,X2)),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ) )
=> ( ~ equal(xi,xj)
=> ~ equal(szmzizndt0(sdtlpdtrp0(xN,xi)),szmzizndt0(sdtlpdtrp0(xN,xj))) ) ),
file('/export/starexec/sandbox2/tmp/tmpVsEcsg/sel_theBenchmark.p_1',m__) ).
fof(47,axiom,
( ~ equal(xi,xj)
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
file('/export/starexec/sandbox2/tmp/tmpVsEcsg/sel_theBenchmark.p_1',m__3856_02) ).
fof(79,axiom,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpVsEcsg/sel_theBenchmark.p_1',m__3856) ).
fof(87,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ~ equal(szmzizndt0(sdtlpdtrp0(xN,X2)),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ) )
=> ( ~ equal(xi,xj)
=> ~ equal(szmzizndt0(sdtlpdtrp0(xN,xi)),szmzizndt0(sdtlpdtrp0(xN,xj))) ) ),
inference(assume_negation,[status(cth)],[14]) ).
fof(156,negated_conjecture,
( ! [X1,X2] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| ( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ~ equal(szmzizndt0(sdtlpdtrp0(xN,X2)),szmzizndt0(sdtlpdtrp0(xN,X1))) ) )
& ~ equal(xi,xj)
& equal(szmzizndt0(sdtlpdtrp0(xN,xi)),szmzizndt0(sdtlpdtrp0(xN,xj))) ),
inference(fof_nnf,[status(thm)],[87]) ).
fof(157,negated_conjecture,
( ! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X3),X4)
| ( aSubsetOf0(sdtlpdtrp0(xN,X4),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
& ~ equal(szmzizndt0(sdtlpdtrp0(xN,X4)),szmzizndt0(sdtlpdtrp0(xN,X3))) ) )
& ~ equal(xi,xj)
& equal(szmzizndt0(sdtlpdtrp0(xN,xi)),szmzizndt0(sdtlpdtrp0(xN,xj))) ),
inference(variable_rename,[status(thm)],[156]) ).
fof(158,negated_conjecture,
! [X3,X4] :
( ( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X3),X4)
| ( aSubsetOf0(sdtlpdtrp0(xN,X4),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
& ~ equal(szmzizndt0(sdtlpdtrp0(xN,X4)),szmzizndt0(sdtlpdtrp0(xN,X3))) ) )
& ~ equal(xi,xj)
& equal(szmzizndt0(sdtlpdtrp0(xN,xi)),szmzizndt0(sdtlpdtrp0(xN,xj))) ),
inference(shift_quantors,[status(thm)],[157]) ).
fof(159,negated_conjecture,
! [X3,X4] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X4),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ sdtlseqdt0(szszuzczcdt0(X3),X4)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0) )
& ( ~ equal(szmzizndt0(sdtlpdtrp0(xN,X4)),szmzizndt0(sdtlpdtrp0(xN,X3)))
| ~ sdtlseqdt0(szszuzczcdt0(X3),X4)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0) )
& ~ equal(xi,xj)
& equal(szmzizndt0(sdtlpdtrp0(xN,xi)),szmzizndt0(sdtlpdtrp0(xN,xj))) ),
inference(distribute,[status(thm)],[158]) ).
cnf(160,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(161,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[159]) ).
cnf(162,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X2),X1)
| szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[159]) ).
fof(326,plain,
( equal(xi,xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(fof_nnf,[status(thm)],[47]) ).
cnf(327,plain,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| xi = xj ),
inference(split_conjunct,[status(thm)],[326]) ).
cnf(458,plain,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(459,plain,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(507,plain,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ),
inference(sr,[status(thm)],[327,161,theory(equality)]) ).
cnf(911,plain,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj))
| ~ aElementOf0(xj,szNzAzT0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(spm,[status(thm)],[162,507,theory(equality)]) ).
cnf(917,plain,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| $false
| ~ aElementOf0(xj,szNzAzT0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(rw,[status(thm)],[911,160,theory(equality)]) ).
cnf(918,plain,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| $false
| $false
| ~ aElementOf0(xi,szNzAzT0) ),
inference(rw,[status(thm)],[917,458,theory(equality)]) ).
cnf(919,plain,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[918,459,theory(equality)]) ).
cnf(920,plain,
sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(cn,[status(thm)],[919,theory(equality)]) ).
cnf(1348,plain,
( szmzizndt0(sdtlpdtrp0(xN,xj)) != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(xi,szNzAzT0)
| ~ aElementOf0(xj,szNzAzT0) ),
inference(spm,[status(thm)],[162,920,theory(equality)]) ).
cnf(1357,plain,
( $false
| ~ aElementOf0(xi,szNzAzT0)
| ~ aElementOf0(xj,szNzAzT0) ),
inference(rw,[status(thm)],[1348,160,theory(equality)]) ).
cnf(1358,plain,
( $false
| $false
| ~ aElementOf0(xj,szNzAzT0) ),
inference(rw,[status(thm)],[1357,459,theory(equality)]) ).
cnf(1359,plain,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[1358,458,theory(equality)]) ).
cnf(1360,plain,
$false,
inference(cn,[status(thm)],[1359,theory(equality)]) ).
cnf(1361,plain,
$false,
1360,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM578+1 : TPTP v7.0.0. Released v4.0.0.
% 0.02/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n046.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Fri Jan 5 09:31:00 CST 2018
% 0.02/0.24 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.39 -running prover on /export/starexec/sandbox2/tmp/tmpVsEcsg/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.39 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpVsEcsg/sel_theBenchmark.p_1']
% 0.06/0.39 -prover status Theorem
% 0.06/0.39 Problem theBenchmark.p solved in phase 0.
% 0.06/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.39 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.39 Solved 1 out of 1.
% 0.06/0.39 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.39 # SZS status Theorem
% 0.06/0.39 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------