%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM021+4 : 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 : n016.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 01:04:20 PM UTC 2026
% Result : Theorem 2.17s 6.31s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 123 ( 17 equ)
% Maximal formula atoms : 15 ( 5 avg)
% Number of connectives : 117 ( 16 ~; 35 |; 66 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 5 !; 11 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f23,axiom,
( aNormalFormOfIn0(xd,xw,xR)
& ~ ? [X0] : aReductOfIn0(X0,xd,xR)
& sdtmndtasgtdt0(xw,xR,xd)
& ( ( sdtmndtplgtdt0(xw,xR,xd)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xd)
& aReductOfIn0(X0,xw,xR)
& aElement0(X0) )
| aReductOfIn0(xd,xw,xR) ) )
| xw = xd )
& aElement0(xd) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).
fof(f24,axiom,
( sdtmndtasgtdt0(xd,xR,xx)
& ( ( sdtmndtplgtdt0(xd,xR,xx)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xx)
& aReductOfIn0(X0,xd,xR)
& aElement0(X0) )
| aReductOfIn0(xx,xd,xR) ) )
| xd = xx )
& sdtmndtasgtdt0(xb,xR,xx)
& ( ( sdtmndtplgtdt0(xb,xR,xx)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xx)
& aReductOfIn0(X0,xb,xR)
& aElement0(X0) )
| aReductOfIn0(xx,xb,xR) ) )
| xb = xx )
& aElement0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__850) ).
fof(f25,conjecture,
( sdtmndtasgtdt0(xb,xR,xd)
| sdtmndtplgtdt0(xb,xR,xd)
| ? [X0] :
( sdtmndtplgtdt0(X0,xR,xd)
& aReductOfIn0(X0,xb,xR)
& aElement0(X0) )
| aReductOfIn0(xd,xb,xR)
| xb = xd ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f26,negated_conjecture,
~ ( sdtmndtasgtdt0(xb,xR,xd)
| sdtmndtplgtdt0(xb,xR,xd)
| ? [X0] :
( sdtmndtplgtdt0(X0,xR,xd)
& aReductOfIn0(X0,xb,xR)
& aElement0(X0) )
| aReductOfIn0(xd,xb,xR)
| xb = xd ),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f35,plain,
( aNormalFormOfIn0(xd,xw,xR)
& ~ ? [X1] : aReductOfIn0(X1,xd,xR)
& sdtmndtasgtdt0(xw,xR,xd)
& ( ( sdtmndtplgtdt0(xw,xR,xd)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xd)
& aReductOfIn0(X0,xw,xR)
& aElement0(X0) )
| aReductOfIn0(xd,xw,xR) ) )
| xw = xd )
& aElement0(xd) ),
inference(rectify,[],[f23]) ).
fof(f36,plain,
( sdtmndtasgtdt0(xd,xR,xx)
& ( ( sdtmndtplgtdt0(xd,xR,xx)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xx)
& aReductOfIn0(X1,xd,xR)
& aElement0(X1) )
| aReductOfIn0(xx,xd,xR) ) )
| xd = xx )
& sdtmndtasgtdt0(xb,xR,xx)
& ( ( sdtmndtplgtdt0(xb,xR,xx)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xx)
& aReductOfIn0(X0,xb,xR)
& aElement0(X0) )
| aReductOfIn0(xx,xb,xR) ) )
| xb = xx )
& aElement0(xx) ),
inference(rectify,[],[f24]) ).
fof(f61,plain,
( aNormalFormOfIn0(xd,xw,xR)
& ! [X1] : ~ aReductOfIn0(X1,xd,xR)
& sdtmndtasgtdt0(xw,xR,xd)
& ( ( sdtmndtplgtdt0(xw,xR,xd)
& ( ? [X0] :
( sdtmndtplgtdt0(X0,xR,xd)
& aReductOfIn0(X0,xw,xR)
& aElement0(X0) )
| aReductOfIn0(xd,xw,xR) ) )
| xw = xd )
& aElement0(xd) ),
inference(ennf_transformation,[],[f35]) ).
fof(f62,plain,
( ~ sdtmndtasgtdt0(xb,xR,xd)
& ~ sdtmndtplgtdt0(xb,xR,xd)
& ! [X0] :
( ~ sdtmndtplgtdt0(X0,xR,xd)
| ~ aReductOfIn0(X0,xb,xR)
| ~ aElement0(X0) )
& ~ aReductOfIn0(xd,xb,xR)
& xb != xd ),
inference(ennf_transformation,[],[f26]) ).
fof(f114,plain,
( aNormalFormOfIn0(xd,xw,xR)
& ! [X1] : ~ aReductOfIn0(X1,xd,xR)
& sdtmndtasgtdt0(xw,xR,xd)
& ( ( sdtmndtplgtdt0(xw,xR,xd)
& ( ( sdtmndtplgtdt0(sK33,xR,xd)
& aReductOfIn0(sK33,xw,xR)
& aElement0(sK33) )
| aReductOfIn0(xd,xw,xR) ) )
| xw = xd )
& aElement0(xd) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK33]),skolemize(X0,sK33)],[f61]) ).
fof(f115,plain,
( sdtmndtasgtdt0(xd,xR,xx)
& ( ( sdtmndtplgtdt0(xd,xR,xx)
& ( ( sdtmndtplgtdt0(sK35,xR,xx)
& aReductOfIn0(sK35,xd,xR)
& aElement0(sK35) )
| aReductOfIn0(xx,xd,xR) ) )
| xd = xx )
& sdtmndtasgtdt0(xb,xR,xx)
& ( ( sdtmndtplgtdt0(xb,xR,xx)
& ( ( sdtmndtplgtdt0(sK34,xR,xx)
& aReductOfIn0(sK34,xb,xR)
& aElement0(sK34) )
| aReductOfIn0(xx,xb,xR) ) )
| xb = xx )
& aElement0(xx) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK34,sK35]),skolemize(X0,sK34),skolemize(X1,sK35)],[f36]) ).
fof(f238,plain,
! [X1] : ~ aReductOfIn0(X1,xd,xR),
inference(cnf_transformation,[],[f114]) ).
fof(f248,plain,
( aReductOfIn0(sK35,xd,xR)
| aReductOfIn0(xx,xd,xR)
| xd = xx ),
inference(cnf_transformation,[],[f115]) ).
fof(f250,plain,
sdtmndtasgtdt0(xb,xR,xx),
inference(cnf_transformation,[],[f115]) ).
fof(f256,plain,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(cnf_transformation,[],[f62]) ).
tcf(c_176,plain,
! [X0: $i] : ~ aReductOfIn0(X0,xd,xR),
inference(cnf_transformation,[],[f238]) ).
tcf(c_183,plain,
sdtmndtasgtdt0(xb,xR,xx),
inference(cnf_transformation,[],[f250]) ).
tcf(c_185,plain,
( aReductOfIn0(sK35,xd,xR)
| aReductOfIn0(xx,xd,xR)
| ( xd = xx ) ),
inference(cnf_transformation,[],[f248]) ).
tcf(c_193,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(cnf_transformation,[],[f256]) ).
tcf(c_312,plain,
( aReductOfIn0(sK35,xd,xR)
| ( xd = xx ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_185,c_176]) ).
tcf(c_432,plain,
xd = xx,
inference(forward_subsumption_resolution,[status(thm)],[c_312,c_176]) ).
tcf(c_1206,plain,
sdtmndtasgtdt0(xb,xR,xd),
inference(light_normalisation,[status(thm)],[c_183,c_432]) ).
tcf(c_1207,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_193,c_1206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM021+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.39 % Computer : n016.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Fri Sep 25 07:53:03 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.44
% 0.16/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.44
% 0.16/5.44 % Detected problem language: tptp
% 0.16/5.46 % Proving...
% 2.17/6.31 % SZS status Started for theBenchmark.p
% 2.17/6.31 % SZS status Theorem for theBenchmark.p
% 2.17/6.31
% 2.17/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.17/6.31
% 2.17/6.31 % ------ iProver source info
% 2.17/6.31
% 2.17/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 2.17/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.17/6.31 % git: non_committed_changes: false
% 2.17/6.31
% 2.17/6.31 % ------ Parsing...
% 2.17/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.17/6.31
% 2.17/6.31 % ------ Preprocessing...%
% 2.17/6.31
% 2.17/6.31 % SZS status Theorem for theBenchmark.p
% 2.17/6.31
% 2.17/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/6.31
% 2.17/6.31
%------------------------------------------------------------------------------