%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN326+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:43 PM UTC 2026
% Result : Theorem 1.16s 1.28s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 64 ( 17 ~; 13 |; 18 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 24 ( 0 sgn 18 !; 6 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
! [X1,X2] :
( ( ( big_f(X1,X2)
=> ( big_g(X1)
=> big_h(X0) ) )
=> big_f(X0,X0) )
=> ( ( ( big_f(X2,X0)
=> big_g(X0) )
=> big_h(X2) )
=> ( big_f(X0,X1)
=> big_f(X2,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_12_1) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1,X2] :
( ( ( big_f(X1,X2)
=> ( big_g(X1)
=> big_h(X0) ) )
=> big_f(X0,X0) )
=> ( ( ( big_f(X2,X0)
=> big_g(X0) )
=> big_h(X2) )
=> ( big_f(X0,X1)
=> big_f(X2,X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
! [X0] :
? [X1,X2] :
( ( ( big_f(X1,X2)
& big_g(X1)
& ~ big_h(X0) )
| big_f(X0,X0) )
& ( ( big_f(X2,X0)
& ~ big_g(X0) )
| big_h(X2) )
& big_f(X0,X1)
& ~ big_f(X2,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0] :
? [X1,X2] :
( ( ( big_f(X1,X2)
& big_g(X1)
& ~ big_h(X0) )
| big_f(X0,X0) )
& ( ( big_f(X2,X0)
& ~ big_g(X0) )
| big_h(X2) )
& big_f(X0,X1)
& ~ big_f(X2,X2) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0] :
( ( ( big_f(sK0(X0),sK1(X0))
& big_g(sK0(X0))
& ~ big_h(X0) )
| big_f(X0,X0) )
& ( ( big_f(sK1(X0),X0)
& ~ big_g(X0) )
| big_h(sK1(X0)) )
& big_f(X0,sK0(X0))
& ~ big_f(sK1(X0),sK1(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X1,sK0(X0)),skolemize(X2,sK1(X0))],[f4]) ).
fof(f7,plain,
! [X0] :
( big_g(sK0(X0))
| big_f(X0,X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X0] :
( ~ big_h(X0)
| big_f(X0,X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f10,plain,
! [X0] :
( ~ big_g(X0)
| big_h(sK1(X0)) ),
inference(cnf_transformation,[],[f5]) ).
fof(f12,plain,
! [X0] : ~ big_f(sK1(X0),sK1(X0)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] : ~ big_f(sK1(X0),sK1(X0)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( big_h(sK1(X0))
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( big_f(X0,X0)
| ~ big_h(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] :
( big_g(sK0(X0))
| big_f(X0,X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_87,plain,
! [X0: $i] :
( big_f(X0,X0)
| big_h(sK1(sK0(X0))) ),
inference(resolution,[status(thm)],[c_51,c_54]) ).
tcf(c_97,plain,
! [X0: $i] : big_h(sK1(sK0(sK1(X0)))),
inference(resolution,[status(thm)],[c_49,c_87]) ).
tcf(c_102,plain,
! [X0: $i] : ~ big_h(sK1(X0)),
inference(resolution,[status(thm)],[c_49,c_53]) ).
tcf(c_107,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_97,c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN326+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.13/0.38 % Computer : n019.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri Sep 25 00:50:35 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.42
% 0.13/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 1.16/1.28 % SZS status Started for theBenchmark.p
% 1.16/1.28 % SZS status Theorem for theBenchmark.p
% 1.16/1.28
% 1.16/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.16/1.28
% 1.16/1.28 % ------ iProver source info
% 1.16/1.28
% 1.16/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.16/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.16/1.28 % git: non_committed_changes: false
% 1.16/1.28
% 1.16/1.28 % ------ Parsing...
% 1.16/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.16/1.28
% 1.16/1.28 % ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe:1:0s%
% 1.16/1.28
% 1.16/1.28 % SZS status Theorem for theBenchmark.p
% 1.16/1.28
% 1.16/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/1.28
% 1.16/1.28
%------------------------------------------------------------------------------