%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM514+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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:25:47 PM UTC 2026
% Result : Theorem 3.92s 1.28s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 9 unt; 2 def)
% Number of atoms : 48 ( 19 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 40 ( 16 ~; 8 |; 14 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 6 !; 2 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f55,axiom,
( sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm)
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& xk = sdtasdt0(xr,sdtsldt0(xk,xr))
& aNaturalNumber0(sdtsldt0(xk,xr)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2613) ).
fof(f56,conjecture,
( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) )
=> ( doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
| ? [X0] :
( sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f57,negated_conjecture,
~ ( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) )
=> ( doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
| ? [X0] :
( sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f56]) ).
fof(f141,plain,
( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
& ! [X0] :
( sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f57]) ).
fof(f142,plain,
( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
& ! [X0] :
( sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm)
| ~ aNaturalNumber0(X0) ) ),
inference(flattening,[],[f141]) ).
fof(f337,plain,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
inference(cnf_transformation,[],[f55]) ).
fof(f341,plain,
aNaturalNumber0(sdtsldt0(xk,xr)),
inference(cnf_transformation,[],[f55]) ).
fof(f345,plain,
! [X0] :
( sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_203,plain,
aNaturalNumber0(sdtsldt0(xk,xr)),
inference(cnf_transformation,[],[f341]) ).
tcf(c_207,plain,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
inference(cnf_transformation,[],[f337]) ).
tcf(c_208,negated_conjecture,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X0) ) ),
inference(cnf_transformation,[],[f345]) ).
tcf(c_1271,plain,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ( sdtasdt0(xp,sdtsldt0(xk,xr)) != sdtasdt0(xp,X0) ) ),
inference(light_normalisation,[status(thm)],[c_208,c_207]) ).
tcf(c_9367,definition,
iPr_def_10 = sdtsldt0(xk,xr),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_9368,definition,
iPr_def_11 = sdtasdt0(xp,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_9371,plain,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ( iPr_def_11 != sdtasdt0(xp,X0) ) ),
inference(demodulation,[status(thm)],[c_1271,c_9367,c_9368]) ).
tcf(c_11256,plain,
aNaturalNumber0(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_203,c_9367]) ).
tcf(c_11276,plain,
~ aNaturalNumber0(iPr_def_10),
inference(superposition,[status(thm)],[c_9368,c_9371]) ).
tcf(c_11277,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11276,c_11256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM514+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 04:23:05 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 3.92/1.28 % SZS status Started for theBenchmark.p
% 3.92/1.28 % SZS status Theorem for theBenchmark.p
% 3.92/1.28
% 3.92/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.92/1.28
% 3.92/1.28 % ------ iProver source info
% 3.92/1.28
% 3.92/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.92/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.92/1.28 % git: non_committed_changes: false
% 3.92/1.28
% 3.92/1.28 % ------ Parsing...
% 3.92/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.92/1.28
% 3.92/1.28 % ------ Preprocessing... sup_sim: 11 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.92/1.28
% 3.92/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.92/1.28
% 3.92/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.92/1.28 % ------ Proving...
% 3.92/1.28 % ------ Problem Properties
% 3.92/1.28
% 3.92/1.28 %
% 3.92/1.28 % clauses 151
% 3.92/1.28 % conjectures 2
% 3.92/1.28 % EPR 56
% 3.92/1.28 % Horn 109
% 3.92/1.28 % unary 66
% 3.92/1.28 % binary 19
% 3.92/1.28 % lits 428
% 3.92/1.28 % lits eq 138
% 3.92/1.28 % fd_pure 0
% 3.92/1.28 % fd_pseudo 0
% 3.92/1.28 % fd_cond 24
% 3.92/1.28 % fd_pseudo_cond 11
% 3.92/1.28 % AC symbols 0
% 3.92/1.28
% 3.92/1.28 % ------ Schedule dynamic 5 is on
% 3.92/1.28
% 3.92/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.92/1.28
% 3.92/1.28
% 3.92/1.28 % ------
% 3.92/1.28 % Current options:
% 3.92/1.28 % ------
% 3.92/1.28
% 3.92/1.28
% 3.92/1.28 %
% 3.92/1.28
% 3.92/1.28 % ------ Proving...
% 3.92/1.28 %
% 3.92/1.28
% 3.92/1.28 % SZS status Theorem for theBenchmark.p
% 3.92/1.28
% 3.92/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.92/1.28
% 3.92/1.28
%------------------------------------------------------------------------------