%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : RNG103+2 : 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 : n009.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 05:05:21 PM UTC 2026
% Result : Theorem 1.41s 1.79s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 10 unt; 0 def)
% Number of atoms : 33 ( 13 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 29 ( 12 ~; 10 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAMDistr) ).
fof(m__1979,hypothesis,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1979) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1905) ).
fof(m__,conjecture,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1956) ).
fof(c_0_5,plain,
! [X110,X111,X112] :
( ( sdtasdt0(X110,sdtpldt0(X111,X112)) = sdtpldt0(sdtasdt0(X110,X111),sdtasdt0(X110,X112))
| ~ aElement0(X110)
| ~ aElement0(X111)
| ~ aElement0(X112) )
& ( sdtasdt0(sdtpldt0(X111,X112),X110) = sdtpldt0(sdtasdt0(X111,X110),sdtasdt0(X112,X110))
| ~ aElement0(X110)
| ~ aElement0(X111)
| ~ aElement0(X112) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])]) ).
cnf(c_0_6,plain,
( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
sdtasdt0(xc,xv) = xy,
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_8,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_9,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
fof(c_0_10,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_11,hypothesis,
( sdtpldt0(sdtasdt0(xc,X1),xy) = sdtasdt0(xc,sdtpldt0(X1,xv))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]) ).
cnf(c_0_12,hypothesis,
sdtasdt0(xc,xu) = xx,
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_13,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_14,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : RNG103+2 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n009.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 01:50:56 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.41/1.79 % Version : CSE_E---1.7
% 1.41/1.79 % Problem : theBenchmark.p
% 1.41/1.79 % SZS status Theorem for theBenchmark.p
% 1.41/1.79 % SZS output start CNFRefutation
% See solution above
% 1.41/1.79 % Total time : 1.371s
%------------------------------------------------------------------------------