%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM607+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n017.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:00 PM UTC 2026
% Result : Theorem 2.83s 2.47s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 47 ( 2 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 45 ( 11 ~; 12 |; 16 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| aElementOf0(xQ,szDzozmdt0(xc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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/sandbox/benchmark/theBenchmark.p',m__5078) ).
fof(m__4998,hypothesis,
( ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xO,xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(c_0_3,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| aElementOf0(xQ,szDzozmdt0(xc)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
! [X489] :
( aSet0(xQ)
& ( ~ aElementOf0(X489,xQ)
| aElementOf0(X489,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])])]) ).
fof(c_0_5,negated_conjecture,
( aElementOf0(esk41_0,xQ)
& ~ aElementOf0(esk41_0,xS)
& ~ aSubsetOf0(xQ,xS)
& aElementOf0(esk42_0,xQ)
& ~ aElementOf0(esk42_0,xS)
& ~ aSubsetOf0(xQ,xS)
& ~ aElementOf0(xQ,szDzozmdt0(xc)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,hypothesis,
! [X488] :
( ( ~ aElementOf0(X488,xO)
| aElementOf0(X488,xS) )
& aSubsetOf0(xO,xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4998])])]) ).
cnf(c_0_7,hypothesis,
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
aElementOf0(esk42_0,xQ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
aElementOf0(esk42_0,xO),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ aElementOf0(esk42_0,xS),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM607+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n017.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 00:49:12 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 2.83/2.47 % Version : CSE_E---1.7
% 2.83/2.47 % Problem : theBenchmark.p
% 2.83/2.47 % SZS status Theorem for theBenchmark.p
% 2.83/2.47 % SZS output start CNFRefutation
% See solution above
% 2.83/2.48 % Total time : 1.827s
%------------------------------------------------------------------------------