%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM613+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:58:02 PM UTC 2026
% Result : Theorem 4.22s 3.51s
% Output : CNFRefutation 4.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 10 unt; 0 def)
% Number of atoms : 42 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 11 ~; 9 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSuccEquSucc,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccEquSucc) ).
fof(m__5078,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(m__5255,hypothesis,
( sbrdtbr0(xQ) = szszuzczcdt0(xk)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5255) ).
fof(m__,conjecture,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_5,plain,
! [X305,X306] :
( ~ aElementOf0(X305,szNzAzT0)
| ~ aElementOf0(X306,szNzAzT0)
| szszuzczcdt0(X305) != szszuzczcdt0(X306)
| X305 = X306 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])]) ).
fof(c_0_6,hypothesis,
! [X495] :
( aSet0(xQ)
& ( ~ aElementOf0(X495,xQ)
| aElementOf0(X495,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])]) ).
cnf(c_0_7,plain,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| szszuzczcdt0(X1) != szszuzczcdt0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_9,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_10,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_11,hypothesis,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_13,hypothesis,
( X1 = xk
| szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_14,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_16,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM613+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n003.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 00:50:41 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 4.22/3.51 % Version : CSE_E---1.7
% 4.22/3.51 % Problem : theBenchmark.p
% 4.22/3.51 % SZS status Theorem for theBenchmark.p
% 4.22/3.51 % SZS output start CNFRefutation
% See solution above
% 4.22/3.52 % Total time : 2.772s
%------------------------------------------------------------------------------