%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN059+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n019.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 03:39:02 PM UTC 2026
% Result : Theorem 1.20s 6.49s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 59 ( 11 unt; 1 def)
% Number of atoms : 226 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 276 ( 109 ~; 115 |; 40 &)
% ( 3 <=>; 6 =>; 0 <=; 3 <~>)
% Maximal formula depth : 8 ( 4 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 : 6 ( 5 usr; 2 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 72 ( 0 sgn 60 !; 12 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] : big_f(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel29_1) ).
fof(f2,axiom,
? [X0] : big_g(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel29_2) ).
fof(f3,conjecture,
( ( ! [X1] :
( big_g(X1)
=> big_j(X1) )
& ! [X0] :
( big_f(X0)
=> big_h(X0) ) )
<=> ! [X2,X3] :
( ( big_g(X3)
& big_f(X2) )
=> ( big_j(X3)
& big_h(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel29) ).
fof(f4,negated_conjecture,
~ ( ( ! [X1] :
( big_g(X1)
=> big_j(X1) )
& ! [X0] :
( big_f(X0)
=> big_h(X0) ) )
<=> ! [X2,X3] :
( ( big_g(X3)
& big_f(X2) )
=> ( big_j(X3)
& big_h(X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
( ( ! [X1] :
( ~ big_g(X1)
| big_j(X1) )
& ! [X0] :
( ~ big_f(X0)
| big_h(X0) ) )
<~> ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_j(X3)
& big_h(X2) ) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ! [X1] :
( ~ big_g(X1)
| big_j(X1) )
& ! [X0] :
( ~ big_f(X0)
| big_h(X0) ) )
<~> ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_j(X3)
& big_h(X2) ) ) ),
inference(flattening,[],[f5]) ).
fof(f9,plain,
big_f(sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f1]) ).
fof(f10,plain,
big_g(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f2]) ).
fof(f15,plain,
( ( sP0
| ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_j(X3)
& big_h(X2) ) ) )
& ( ~ sP0
| ? [X2,X3] :
( big_g(X3)
& big_f(X2)
& ( ~ big_j(X3)
| ~ big_h(X2) ) ) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f16,plain,
( ( sP0
| ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_j(X3)
& big_h(X2) ) ) )
& ( ~ sP0
| ? [X0,X1] :
( big_g(X1)
& big_f(X0)
& ( ~ big_j(X1)
| ~ big_h(X0) ) ) ) ),
inference(rectify,[],[f15]) ).
fof(f17,plain,
( ( sP0
| ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_j(X3)
& big_h(X2) ) ) )
& ( ~ sP0
| ( big_g(sK6)
& big_f(sK5)
& ( ~ big_j(sK6)
| ~ big_h(sK5) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f16]) ).
fof(f18,plain,
big_f(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
big_g(sK2),
inference(cnf_transformation,[],[f10]) ).
fof(f26,plain,
! [X2,X3] :
( sP0
| ~ big_g(X3)
| ~ big_f(X2)
| big_j(X3) ),
inference(cnf_transformation,[],[f17]) ).
fof(f27,plain,
! [X2,X3] :
( sP0
| ~ big_g(X3)
| ~ big_f(X2)
| big_h(X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f28,plain,
( ~ sP0
| big_g(sK6) ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
( ~ sP0
| big_f(sK5) ),
inference(cnf_transformation,[],[f17]) ).
fof(f30,plain,
( ~ sP0
| ~ big_j(sK6)
| ~ big_h(sK5) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_49,plain,
big_f(sK1),
inference(cnf_transformation,[],[f18]) ).
tcf(c_50,plain,
big_g(sK2),
inference(cnf_transformation,[],[f19]) ).
tcf(c_57,negated_conjecture,
( ~ sP0
| ~ big_j(sK6)
| ~ big_h(sK5) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_58,negated_conjecture,
( big_f(sK5)
| ~ sP0 ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_59,negated_conjecture,
( big_g(sK6)
| ~ sP0 ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_60,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0
| big_h(X0)
| ~ big_g(X1)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_61,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0
| big_j(X1)
| ~ big_g(X1)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f7,definition,
( sP0
<=> ( ! [X1] :
( ~ big_g(X1)
| big_j(X1) )
& ! [X0] :
( ~ big_f(X0)
| big_h(X0) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f8,plain,
( sP0
<~> ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_j(X3)
& big_h(X2) ) ) ),
inference(definition_folding,[],[f6,f7]) ).
fof(f11,plain,
( ( ~ sP0
| ( ! [X1] :
( ~ big_g(X1)
| big_j(X1) )
& ! [X0] :
( ~ big_f(X0)
| big_h(X0) ) ) )
& ( ? [X1] :
( big_g(X1)
& ~ big_j(X1) )
| ? [X0] :
( big_f(X0)
& ~ big_h(X0) )
| sP0 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f12,plain,
( ( ~ sP0
| ( ! [X1] :
( ~ big_g(X1)
| big_j(X1) )
& ! [X0] :
( ~ big_f(X0)
| big_h(X0) ) ) )
& ( ? [X1] :
( big_g(X1)
& ~ big_j(X1) )
| ? [X0] :
( big_f(X0)
& ~ big_h(X0) )
| sP0 ) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
( ( ~ sP0
| ( ! [X3] :
( ~ big_g(X3)
| big_j(X3) )
& ! [X2] :
( ~ big_f(X2)
| big_h(X2) ) ) )
& ( ? [X1] :
( big_g(X1)
& ~ big_j(X1) )
| ? [X0] :
( big_f(X0)
& ~ big_h(X0) )
| sP0 ) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
( ( ~ sP0
| ( ! [X3] :
( ~ big_g(X3)
| big_j(X3) )
& ! [X2] :
( ~ big_f(X2)
| big_h(X2) ) ) )
& ( ( big_g(sK4)
& ~ big_j(sK4) )
| ( big_f(sK3)
& ~ big_h(sK3) )
| sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f13]) ).
fof(f20,plain,
! [X3] :
( ~ sP0
| ~ big_g(X3)
| big_j(X3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X2] :
( ~ sP0
| ~ big_f(X2)
| big_h(X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
( big_g(sK4)
| big_f(sK3)
| sP0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
( ~ big_j(sK4)
| big_f(sK3)
| sP0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
( big_g(sK4)
| ~ big_h(sK3)
| sP0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
( ~ big_j(sK4)
| ~ big_h(sK3)
| sP0 ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_51,plain,
( sP0
| ~ big_j(sK4)
| ~ big_h(sK3) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_52,plain,
( sP0
| big_g(sK4)
| ~ big_h(sK3) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_53,plain,
( sP0
| big_f(sK3)
| ~ big_j(sK4) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_54,plain,
( sP0
| big_g(sK4)
| big_f(sK3) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_55,plain,
! [X0: $i] :
( big_h(X0)
| ~ sP0
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_56,plain,
! [X0: $i] :
( big_j(X0)
| ~ sP0
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( ~ big_f(X0)
| ~ big_g(X1)
| big_h(X0) ),
inference(global_subsumption_just,[status(thm)],[c_60,c_55,c_60]) ).
tcf(c_67,negated_conjecture,
! [X0: $i,X1: $i] :
( big_h(X0)
| ~ big_g(X1)
| ~ big_f(X0) ),
inference(renaming,[status(thm)],[c_66]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i] :
( big_j(X1)
| ~ big_g(X1)
| ~ big_f(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_61,c_56]) ).
tcf(c_137,plain,
! [X0: $i] :
( sP0
| big_g(sK4)
| ~ big_f(sK3)
| ~ big_g(X0) ),
inference(resolution,[status(thm)],[c_52,c_67]) ).
tcf(c_139,plain,
! [X0: $i] :
( sP0
| big_g(sK4)
| ~ big_g(X0) ),
inference(global_subsumption_just,[status(thm)],[c_137,c_54,c_137]) ).
tcf(c_152,plain,
! [X0: $i] :
( sP0
| ~ big_j(sK4)
| ~ big_f(sK3)
| ~ big_g(X0) ),
inference(resolution,[status(thm)],[c_51,c_67]) ).
tcf(c_154,plain,
! [X0: $i] :
( sP0
| ~ big_j(sK4)
| ~ big_g(X0) ),
inference(global_subsumption_just,[status(thm)],[c_152,c_53,c_152]) ).
tcf(c_181,plain,
( ~ sP0
| ~ big_j(sK6)
| ~ big_f(sK5) ),
inference(resolution,[status(thm)],[c_55,c_57]) ).
tcf(c_182,plain,
( ~ sP0
| ~ big_j(sK6) ),
inference(global_subsumption_just,[status(thm)],[c_181,c_58,c_181]) ).
tcf(c_198,plain,
! [X0: $i] :
( big_j(X0)
| ~ big_g(X0) ),
inference(resolution,[status(thm)],[c_49,c_116]) ).
tcf(c_213,plain,
! [X0: $i] :
( sP0
| ~ big_g(sK4)
| ~ big_g(X0) ),
inference(resolution,[status(thm)],[c_154,c_198]) ).
tcf(c_215,plain,
! [X0: $i] :
( sP0
| ~ big_g(X0) ),
inference(global_subsumption_just,[status(thm)],[c_213,c_139,c_213]) ).
tcf(c_224,plain,
( ~ sP0
| ~ big_g(sK6) ),
inference(resolution,[status(thm)],[c_198,c_182]) ).
tcf(c_225,plain,
~ sP0,
inference(global_subsumption_just,[status(thm)],[c_224,c_59,c_224]) ).
tcf(c_230,plain,
! [X0: $i] : ~ big_g(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_215,c_225]) ).
tcf(c_235,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN059+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.58 % Computer : n019.cluster.edu
% 0.11/5.58 % Model : x86_64 x86_64
% 0.11/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.58 % Memory : 8046.5625MB
% 0.11/5.58 % OS : Linux 6.8.0-71-generic
% 0.11/5.59 % CPULimit : 300
% 0.11/5.59 % WCLimit : 300
% 0.11/5.59 % DateTime : Fri Sep 25 00:00:13 UTC 2026
% 0.11/5.59 % CPUTime :
% 0.11/5.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.63 Running first-order theorem proving
% 0.14/5.63 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/5.64
% 0.14/5.64 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.64
% 0.14/5.64 % Detected problem language: tptp
% 0.14/5.65 % Proving...
% 1.20/6.49 % SZS status Started for theBenchmark.p
% 1.20/6.49 % SZS status Theorem for theBenchmark.p
% 1.20/6.49
% 1.20/6.49 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.20/6.49
% 1.20/6.49 % ------ iProver source info
% 1.20/6.49
% 1.20/6.49 % git: date: 2026-07-19 20:42:38 +0200
% 1.20/6.49 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.20/6.49 % git: non_committed_changes: false
% 1.20/6.49
% 1.20/6.49 % ------ Parsing...
% 1.20/6.49 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.20/6.49 %
% 1.20/6.49
% 1.20/6.49 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s%
% 1.20/6.49
% 1.20/6.49 % SZS status Theorem for theBenchmark.p
% 1.20/6.49
% 1.20/6.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.20/6.49
% 1.20/6.49
%------------------------------------------------------------------------------