%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG059+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:38:28 PM UTC 2026
% Result : Theorem 4.63s 1.40s
% Output : CNFRefutation 4.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 78 ( 40 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 76 ( 31 ~; 25 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1)
& aScalar0(X0) )
=> ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
& sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
& sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
& sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mArith) ).
fof(f17,axiom,
! [X0,X1] :
( ( aScalar0(X1)
& aScalar0(X0) )
=> ( sdtasdt0(smndt0(X0),X1) = smndt0(sdtasdt0(X0,X1))
& sdtasdt0(X0,smndt0(X1)) = smndt0(sdtasdt0(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMNeg) ).
fof(f52,axiom,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1892) ).
fof(f54,axiom,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1930) ).
fof(f55,axiom,
( xN = sdtasdt0(xR,xS)
& aScalar0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1949) ).
fof(f58,conjecture,
sdtasdt0(smndt0(xS),xR) = smndt0(xN),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f59,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(negated_conjecture,[status(cth)],[f58]) ).
fof(f65,plain,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(flattening,[],[f59]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0)
| ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
& sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
& sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
& sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0)
| ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
& sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2))
& sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
& sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) ) ),
inference(flattening,[],[f78]) ).
fof(f84,plain,
! [X0,X1] :
( ~ aScalar0(X1)
| ~ aScalar0(X0)
| ( sdtasdt0(smndt0(X0),X1) = smndt0(sdtasdt0(X0,X1))
& sdtasdt0(X0,smndt0(X1)) = smndt0(sdtasdt0(X0,X1)) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f85,plain,
! [X0,X1] :
( ~ aScalar0(X1)
| ~ aScalar0(X0)
| ( sdtasdt0(smndt0(X0),X1) = smndt0(sdtasdt0(X0,X1))
& sdtasdt0(X0,smndt0(X1)) = smndt0(sdtasdt0(X0,X1)) ) ),
inference(flattening,[],[f84]) ).
fof(f146,plain,
! [X2,X0,X1] :
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f153,plain,
! [X0,X1] :
( ~ aScalar0(X1)
| ~ aScalar0(X0)
| smndt0(sdtasdt0(X0,X1)) = sdtasdt0(smndt0(X0),X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f208,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f212,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f213,plain,
xN = sdtasdt0(xR,xS),
inference(cnf_transformation,[],[f55]) ).
fof(f217,plain,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(cnf_transformation,[],[f65]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0) )
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(smndt0(X0),X1) = smndt0(sdtasdt0(X0,X1)) )
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(cnf_transformation,[],[f153]) ).
tcf(c_129,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f208]) ).
tcf(c_133,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f212]) ).
tcf(c_136,plain,
sdtasdt0(xR,xS) = xN,
inference(cnf_transformation,[],[f213]) ).
tcf(c_139,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(cnf_transformation,[],[f217]) ).
tcf(c_255,plain,
! [X0: $i] :
( ( sdtasdt0(smndt0(xS),X0) = smndt0(sdtasdt0(xS,X0)) )
| ~ aScalar0(X0) ),
inference(superposition,[status(thm)],[c_133,c_76]) ).
tcf(c_305,plain,
! [X0: $i,X1: $i] :
( ( sdtasdt0(X0,xS) = sdtasdt0(xS,X0) )
| ~ aScalar0(X1)
| ~ aScalar0(X0) ),
inference(superposition,[status(thm)],[c_133,c_71]) ).
tcf(c_577,plain,
sdtasdt0(smndt0(xS),xR) = smndt0(sdtasdt0(xS,xR)),
inference(superposition,[status(thm)],[c_129,c_255]) ).
tcf(c_580,plain,
smndt0(sdtasdt0(xS,xR)) != smndt0(xN),
inference(demodulation,[status(thm)],[c_139,c_577]) ).
tcf(c_770,plain,
! [X0: $i] :
( ( sdtasdt0(xR,xS) = sdtasdt0(xS,xR) )
| ~ aScalar0(X0) ),
inference(superposition,[status(thm)],[c_129,c_305]) ).
tcf(c_2489,plain,
! [X0: $i] :
( ( sdtasdt0(xS,xR) = xN )
| ~ aScalar0(X0) ),
inference(light_normalisation,[status(thm)],[c_770,c_136]) ).
tcf(c_2496,plain,
sdtasdt0(xS,xR) = xN,
inference(superposition,[status(thm)],[c_129,c_2489]) ).
tcf(c_2501,plain,
smndt0(xN) != smndt0(xN),
inference(demodulation,[status(thm)],[c_580,c_2496]) ).
tcf(c_2503,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2501]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG059+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.42 % Computer : n009.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Thu Sep 24 08:00:43 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.48 Running first-order theorem proving
% 0.15/0.48 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.49
% 0.15/0.49 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.49
% 0.15/0.49 % Detected problem language: tptp
% 0.22/0.51 % Proving...
% 4.63/1.40 % SZS status Started for theBenchmark.p
% 4.63/1.40 % SZS status Theorem for theBenchmark.p
% 4.63/1.40
% 4.63/1.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.63/1.40
% 4.63/1.40 % ------ iProver source info
% 4.63/1.40
% 4.63/1.40 % git: date: 2026-07-19 20:42:38 +0200
% 4.63/1.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.63/1.40 % git: non_committed_changes: false
% 4.63/1.40
% 4.63/1.40 % ------ Parsing...
% 4.63/1.40 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.63/1.40 % ------ Proving...
% 4.63/1.40 % ------ Problem Properties
% 4.63/1.40
% 4.63/1.40 %
% 4.63/1.40 % clauses 91
% 4.63/1.40 % conjectures 1
% 4.63/1.40 % EPR 22
% 4.63/1.40 % Horn 81
% 4.63/1.40 % unary 39
% 4.63/1.40 % binary 18
% 4.63/1.40 % lits 224
% 4.63/1.40 % lits eq 71
% 4.63/1.40 % fd_pure 0
% 4.63/1.40 % fd_pseudo 0
% 4.63/1.40 % fd_cond 1
% 4.63/1.40 % fd_pseudo_cond 5
% 4.63/1.40 % AC symbols 0
% 4.63/1.40
% 4.63/1.40 % ------ Input Options Time Limit: Unbounded
% 4.63/1.40
% 4.63/1.40
% 4.63/1.40 % ------
% 4.63/1.40 % Current options:
% 4.63/1.40 % ------
% 4.63/1.40
% 4.63/1.40
% 4.63/1.40 %
% 4.63/1.40
% 4.63/1.40 % ------ Proving...
% 4.63/1.40 %
% 4.63/1.40
% 4.63/1.40 % SZS status Theorem for theBenchmark.p
% 4.63/1.40
% 4.63/1.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.63/1.40
% 4.63/1.40
%------------------------------------------------------------------------------