%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM455+6 : 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 : n014.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:24:31 PM UTC 2026
% Result : Theorem 3.67s 1.20s
% Output : CNFRefutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 84 ( 35 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 84 ( 23 ~; 21 |; 40 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 4 !; 8 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
( aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& ? [X0] :
( sdtasdt0(xp,X0) = sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10))
& aInteger0(X0) )
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& ? [X0] :
( sdtasdt0(xp,X0) = sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2232) ).
fof(f48,axiom,
( sdtpldt0(sz10,smndt0(xp)) != sz10
& sdtpldt0(sz10,xp) != sz10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2258) ).
fof(f49,axiom,
( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10)
| sdtpldt0(sz10,xp) != smndt0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2286) ).
fof(f50,conjecture,
? [X0] :
( ~ ( aElementOf0(X0,cS2200)
& ( X0 = smndt0(sz10)
| X0 = sz10 ) )
& ( aElementOf0(X0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ( ( sdteqdtlpzmzozddtrp0(X0,sz10,xp)
| aDivisorOf0(xp,sdtpldt0(X0,smndt0(sz10)))
| ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(X0,smndt0(sz10))
& aInteger0(X1) ) )
& aInteger0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f51,negated_conjecture,
~ ? [X0] :
( ~ ( aElementOf0(X0,cS2200)
& ( X0 = smndt0(sz10)
| X0 = sz10 ) )
& ( aElementOf0(X0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ( ( sdteqdtlpzmzozddtrp0(X0,sz10,xp)
| aDivisorOf0(xp,sdtpldt0(X0,smndt0(sz10)))
| ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(X0,smndt0(sz10))
& aInteger0(X1) ) )
& aInteger0(X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f50]) ).
fof(f62,plain,
( aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10))
& aInteger0(X1) )
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& ? [X0] :
( sdtasdt0(xp,X0) = sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10))
& aInteger0(X0) ) ),
inference(rectify,[],[f47]) ).
fof(f125,plain,
! [X0] :
( ( aElementOf0(X0,cS2200)
& ( X0 = smndt0(sz10)
| X0 = sz10 ) )
| ( ~ aElementOf0(X0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ( ( ~ sdteqdtlpzmzozddtrp0(X0,sz10,xp)
& ~ aDivisorOf0(xp,sdtpldt0(X0,smndt0(sz10)))
& ! [X1] :
( sdtasdt0(xp,X1) != sdtpldt0(X0,smndt0(sz10))
| ~ aInteger0(X1) ) )
| ~ aInteger0(X0) ) ) ),
inference(ennf_transformation,[],[f51]) ).
fof(f213,plain,
( aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,smndt0(xp)),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)))
& sdtpldt0(sdtpldt0(sz10,smndt0(xp)),smndt0(sz10)) = sdtasdt0(xp,sK38)
& aInteger0(sK38)
& aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& sdteqdtlpzmzozddtrp0(sdtpldt0(sz10,xp),sz10,xp)
& aDivisorOf0(xp,sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)))
& sdtpldt0(sdtpldt0(sz10,xp),smndt0(sz10)) = sdtasdt0(xp,sK37)
& aInteger0(sK37) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK37,sK38]),skolemize(X0,sK37),skolemize(X1,sK38)],[f62]) ).
fof(f430,plain,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(cnf_transformation,[],[f213]) ).
fof(f435,plain,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(cnf_transformation,[],[f213]) ).
fof(f440,plain,
sz10 != sdtpldt0(sz10,smndt0(xp)),
inference(cnf_transformation,[],[f48]) ).
fof(f441,plain,
sz10 != sdtpldt0(sz10,xp),
inference(cnf_transformation,[],[f48]) ).
fof(f442,plain,
( smndt0(sz10) != sdtpldt0(sz10,smndt0(xp))
| smndt0(sz10) != sdtpldt0(sz10,xp) ),
inference(cnf_transformation,[],[f49]) ).
fof(f444,plain,
! [X0] :
( smndt0(sz10) = X0
| sz10 = X0
| ~ aElementOf0(X0,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_268,plain,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(cnf_transformation,[],[f435]) ).
tcf(c_273,plain,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(cnf_transformation,[],[f430]) ).
tcf(c_274,plain,
sdtpldt0(sz10,xp) != sz10,
inference(cnf_transformation,[],[f441]) ).
tcf(c_275,plain,
sdtpldt0(sz10,smndt0(xp)) != sz10,
inference(cnf_transformation,[],[f440]) ).
tcf(c_276,plain,
( ( sdtpldt0(sz10,xp) != smndt0(sz10) )
| ( sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10) ) ),
inference(cnf_transformation,[],[f442]) ).
tcf(c_283,negated_conjecture,
! [X0: $i] :
( ( X0 = sz10 )
| ( smndt0(sz10) = X0 )
| ~ aElementOf0(X0,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(cnf_transformation,[],[f444]) ).
tcf(c_635,plain,
( ( sdtpldt0(sz10,xp) = sz10 )
| ( sdtpldt0(sz10,xp) = smndt0(sz10) ) ),
inference(superposition,[status(thm)],[c_268,c_283]) ).
tcf(c_636,plain,
( ( sdtpldt0(sz10,smndt0(xp)) = sz10 )
| ( sdtpldt0(sz10,smndt0(xp)) = smndt0(sz10) ) ),
inference(superposition,[status(thm)],[c_273,c_283]) ).
tcf(c_637,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_636,c_635,c_276,c_275,c_274]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM455+6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n014.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 04:03:33 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.41 % Detected problem language: tptp
% 0.11/0.42 % Proving...
% 3.67/1.20 % SZS status Started for theBenchmark.p
% 3.67/1.20 % SZS status Theorem for theBenchmark.p
% 3.67/1.20
% 3.67/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.67/1.20
% 3.67/1.20 % ------ iProver source info
% 3.67/1.20
% 3.67/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 3.67/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.67/1.20 % git: non_committed_changes: false
% 3.67/1.20
% 3.67/1.20 % ------ Parsing...
% 3.67/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.67/1.20 % ------ Proving...
% 3.67/1.20 % ------ Problem Properties
% 3.67/1.20
% 3.67/1.20 %
% 3.67/1.20 % clauses 236
% 3.67/1.20 % conjectures 8
% 3.67/1.20 % EPR 33
% 3.67/1.20 % Horn 185
% 3.67/1.20 % unary 30
% 3.67/1.20 % binary 63
% 3.67/1.20 % lits 724
% 3.67/1.20 % lits eq 91
% 3.67/1.20 % fd_pure 0
% 3.67/1.20 % fd_pseudo 0
% 3.67/1.20 % fd_cond 26
% 3.67/1.20 % fd_pseudo_cond 9
% 3.67/1.20 % AC symbols 0
% 3.67/1.20
% 3.67/1.20 % ------ Input Options Time Limit: Unbounded
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20 % ------
% 3.67/1.20 % Current options:
% 3.67/1.20 % ------
% 3.67/1.20
% 3.67/1.20
% 3.67/1.20 %
% 3.67/1.20
% 3.67/1.20 % ------ Proving...
% 3.67/1.20 %
% 3.67/1.20
% 3.67/1.20 % SZS status Theorem for theBenchmark.p
% 3.67/1.20
% 3.67/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.67/1.21
% 3.67/1.21
%------------------------------------------------------------------------------