%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM405+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.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:10 PM UTC 2026
% Result : Theorem 1.80s 1.29s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 4 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 36 ~; 29 |; 9 &)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 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 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 43 ( 0 sgn 37 !; 6 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( ordinal(X2)
& in(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_xboole_0__e2_43__ordinal1) ).
fof(f29,axiom,
! [X0] :
~ ! [X1] :
( in(X1,X0)
<=> ordinal(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_ordinal1) ).
fof(f30,conjecture,
! [X0] :
~ ! [X1] :
( ordinal(X1)
=> in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_ordinal1) ).
fof(f31,negated_conjecture,
~ ! [X0] :
~ ! [X1] :
( ordinal(X1)
=> in(X1,X0) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
fof(f56,plain,
! [X0] :
? [X1] :
( in(X1,X0)
<~> ordinal(X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f57,plain,
? [X0] :
! [X1] :
( ~ ordinal(X1)
| in(X1,X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f75,plain,
! [X0] :
? [X1] :
! [X2] :
( ( ~ in(X2,X1)
| ( ordinal(X2)
& in(X2,X0) ) )
& ( ~ ordinal(X2)
| ~ in(X2,X0)
| in(X2,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f76,plain,
! [X0] :
? [X1] :
! [X2] :
( ( ~ in(X2,X1)
| ( ordinal(X2)
& in(X2,X0) ) )
& ( ~ ordinal(X2)
| ~ in(X2,X0)
| in(X2,X1) ) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0,X2] :
( ( ~ in(X2,sK14(X0))
| ( ordinal(X2)
& in(X2,X0) ) )
& ( ~ ordinal(X2)
| ~ in(X2,X0)
| in(X2,sK14(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X1,sK14(X0))],[f76]) ).
fof(f78,plain,
! [X0] :
? [X1] :
( ( in(X1,X0)
| ordinal(X1) )
& ( ~ in(X1,X0)
| ~ ordinal(X1) ) ),
inference(nnf_transformation,[],[f56]) ).
fof(f79,plain,
! [X0] :
( ( in(sK15(X0),X0)
| ordinal(sK15(X0)) )
& ( ~ in(sK15(X0),X0)
| ~ ordinal(sK15(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X1,sK15(X0))],[f78]) ).
fof(f80,plain,
! [X1] :
( ~ ordinal(X1)
| in(X1,sK16) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16]),skolemize(X0,sK16)],[f57]) ).
fof(f135,plain,
! [X2,X0] :
( ~ in(X2,sK14(X0))
| ordinal(X2) ),
inference(cnf_transformation,[],[f77]) ).
fof(f137,plain,
! [X2,X0] :
( ~ ordinal(X2)
| ~ in(X2,X0)
| in(X2,sK14(X0)) ),
inference(cnf_transformation,[],[f77]) ).
fof(f140,plain,
! [X0] :
( in(sK15(X0),X0)
| ordinal(sK15(X0)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f141,plain,
! [X0] :
( ~ in(sK15(X0),X0)
| ~ ordinal(sK15(X0)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f142,plain,
! [X1] :
( ~ ordinal(X1)
| in(X1,sK16) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] :
( in(X0,sK14(X1))
| ~ ordinal(X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i] :
( ordinal(X0)
| ~ in(X0,sK14(X1)) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_106,plain,
! [X0: $i] :
( ~ ordinal(sK15(X0))
| ~ in(sK15(X0),X0) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_107,plain,
! [X0: $i] :
( ordinal(sK15(X0))
| in(sK15(X0),X0) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_108,negated_conjecture,
! [X0: $i] :
( in(X0,sK16)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_1155,negated_conjecture,
! [X0: $i] :
( in(X0,sK16)
| ~ ordinal(X0) ),
inference(demodulation,[status(thm)],[c_108]) ).
tcf(c_1571,plain,
! [X0: $i] : ordinal(sK15(sK14(X0))),
inference(superposition,[status(thm)],[c_107,c_103]) ).
tcf(c_1701,plain,
! [X0: $i] :
( ~ ordinal(sK15(sK14(X0)))
| ~ in(sK15(sK14(X0)),X0) ),
inference(superposition,[status(thm)],[c_101,c_106]) ).
tcf(c_1703,plain,
! [X0: $i] : ~ in(sK15(sK14(X0)),X0),
inference(forward_subsumption_resolution,[status(thm)],[c_1701,c_1571]) ).
tcf(c_1712,plain,
~ ordinal(sK15(sK14(sK16))),
inference(superposition,[status(thm)],[c_1155,c_1703]) ).
tcf(c_1713,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1712,c_1571]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM405+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 03:53:34 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.80/1.29 % SZS status Started for theBenchmark.p
% 1.80/1.29 % SZS status Theorem for theBenchmark.p
% 1.80/1.29
% 1.80/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/1.29
% 1.80/1.29 % ------ iProver source info
% 1.80/1.29
% 1.80/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.80/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/1.29 % git: non_committed_changes: false
% 1.80/1.29
% 1.80/1.29 % ------ Parsing...
% 1.80/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.80/1.29
% 1.80/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 22 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e %
% 1.80/1.29
% 1.80/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.80/1.29
% 1.80/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.80/1.29 % ------ Proving...
% 1.80/1.29 % ------ Problem Properties
% 1.80/1.29
% 1.80/1.29 %
% 1.80/1.29 % clauses 24
% 1.80/1.29 % conjectures 1
% 1.80/1.29 % EPR 18
% 1.80/1.29 % Horn 22
% 1.80/1.29 % unary 12
% 1.80/1.29 % binary 10
% 1.80/1.29 % lits 38
% 1.80/1.29 % lits eq 2
% 1.80/1.29 % fd_pure 0
% 1.80/1.29 % fd_pseudo 0
% 1.80/1.29 % fd_cond 1
% 1.80/1.29 % fd_pseudo_cond 1
% 1.80/1.29 % AC symbols 0
% 1.80/1.29
% 1.80/1.29 % ------ Schedule dynamic 5 is on
% 1.80/1.29
% 1.80/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.80/1.29
% 1.80/1.29
% 1.80/1.29 % ------
% 1.80/1.29 % Current options:
% 1.80/1.29 % ------
% 1.80/1.29
% 1.80/1.29
% 1.80/1.29 %
% 1.80/1.29
% 1.80/1.29 % ------ Proving...
% 1.80/1.29 %
% 1.80/1.29
% 1.80/1.29 % SZS status Theorem for theBenchmark.p
% 1.80/1.29
% 1.80/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/1.29
% 1.80/1.29
%------------------------------------------------------------------------------