%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM387+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 : n017.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:04 PM UTC 2026
% Result : Theorem 0.62s 1.39s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 26 unt; 2 def)
% Number of atoms : 53 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 11 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 22 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f5,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f6,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f26,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f27,conjecture,
! [X0] : X0 != succ(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_ordinal1) ).
fof(f28,negated_conjecture,
~ ! [X0] : X0 != succ(X0),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f42,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
? [X0] : succ(X0) = X0,
inference(ennf_transformation,[],[f28]) ).
fof(f69,plain,
sK11 = succ(sK11),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X0,sK11)],[f51]) ).
fof(f70,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f75,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f76,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f106,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f26]) ).
fof(f107,plain,
sK11 = succ(sK11),
inference(cnf_transformation,[],[f69]) ).
fof(f115,plain,
! [X0] : in(X0,set_union2(X0,singleton(X0))),
inference(definition_unfolding,[],[f106,f76]) ).
fof(f116,plain,
sK11 = set_union2(sK11,singleton(sK11)),
inference(definition_unfolding,[],[f107,f76]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f75]) ).
tcf(c_82,plain,
! [X0: $i] : in(X0,set_union2(X0,singleton(X0))),
inference(cnf_transformation,[],[f115]) ).
tcf(c_83,negated_conjecture,
set_union2(sK11,singleton(sK11)) = sK11,
inference(cnf_transformation,[],[f116]) ).
tcf(c_364,definition,
iPr_def_10 = singleton(sK11),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_365,definition,
iPr_def_11 = set_union2(sK11,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_366,negated_conjecture,
iPr_def_11 = sK11,
inference(demodulation,[status(thm)],[c_83,c_364,c_365]) ).
tcf(c_559,plain,
singleton(iPr_def_11) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_364,c_366]) ).
tcf(c_560,plain,
set_union2(iPr_def_11,iPr_def_10) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_365,c_366]) ).
tcf(c_561,plain,
set_union2(iPr_def_10,iPr_def_11) = iPr_def_11,
inference(demodulation,[status(thm)],[c_560,c_52]) ).
tcf(c_563,plain,
in(iPr_def_11,set_union2(iPr_def_11,iPr_def_10)),
inference(superposition,[status(thm)],[c_559,c_82]) ).
tcf(c_565,plain,
in(iPr_def_11,iPr_def_11),
inference(demodulation,[status(thm)],[c_563,c_52,c_561]) ).
tcf(c_606,plain,
~ in(iPr_def_11,iPr_def_11),
inference(superposition,[status(thm)],[c_565,c_49]) ).
tcf(c_607,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_606,c_565]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM387+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.43 % Computer : n017.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Thu Sep 24 03:45:15 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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.24/0.51
% 0.24/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.51
% 0.24/0.51 % Detected problem language: tptp
% 0.24/0.53 % Proving...
% 0.62/1.39 % SZS status Started for theBenchmark.p
% 0.62/1.39 % SZS status Theorem for theBenchmark.p
% 0.62/1.39
% 0.62/1.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.62/1.39
% 0.62/1.39 % ------ iProver source info
% 0.62/1.39
% 0.62/1.39 % git: date: 2026-07-19 20:42:38 +0200
% 0.62/1.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.62/1.39 % git: non_committed_changes: false
% 0.62/1.39
% 0.62/1.39 % ------ Parsing...
% 0.62/1.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.62/1.39
% 0.62/1.39 % ------ Preprocessing... sup_sim: 0 sf_s rm: 20 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 0.62/1.39
% 0.62/1.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.62/1.39
% 0.62/1.39 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.62/1.39 % ------ Proving...
% 0.62/1.39 % ------ Problem Properties
% 0.62/1.39
% 0.62/1.39 %
% 0.62/1.39 % clauses 21
% 0.62/1.39 % conjectures 1
% 0.62/1.39 % EPR 11
% 0.62/1.39 % Horn 20
% 0.62/1.39 % unary 14
% 0.62/1.39 % binary 6
% 0.62/1.39 % lits 29
% 0.62/1.39 % lits eq 8
% 0.62/1.39 % fd_pure 0
% 0.62/1.39 % fd_pseudo 0
% 0.62/1.39 % fd_cond 1
% 0.62/1.39 % fd_pseudo_cond 1
% 0.62/1.39 % AC symbols 0
% 0.62/1.39
% 0.62/1.39 % ------ Schedule dynamic 5 is on
% 0.62/1.39
% 0.62/1.39 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.62/1.39
% 0.62/1.39
% 0.62/1.39 % ------
% 0.62/1.39 % Current options:
% 0.62/1.39 % ------
% 0.62/1.39
% 0.62/1.39
% 0.62/1.39 %
% 0.62/1.39
% 0.62/1.39 % ------ Proving...
% 0.62/1.39 %
% 0.62/1.39
% 0.62/1.39 % SZS status Theorem for theBenchmark.p
% 0.62/1.39
% 0.62/1.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.62/1.39
% 0.62/1.39
%------------------------------------------------------------------------------