%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN333+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:45 PM UTC 2026
% Result : Theorem 1.14s 1.27s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 83 ( 35 ~; 27 |; 17 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 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 : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 40 ( 0 sgn 34 !; 6 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0,X1] :
! [X2] :
( big_f(X0,X1)
=> ( ( ( big_g(X0,X1)
& big_f(X0,X1) )
=> ( big_g(X2,X2)
& big_g(X0,X2) ) )
& big_f(X2,X2)
& big_f(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_14_5) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2] :
( big_f(X0,X1)
=> ( ( ( big_g(X0,X1)
& big_f(X0,X1) )
=> ( big_g(X2,X2)
& big_g(X0,X2) ) )
& big_f(X2,X2)
& big_f(X1,X2) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
! [X0,X1] :
? [X2] :
( big_f(X0,X1)
& ( ( big_g(X0,X1)
& big_f(X0,X1)
& ( ~ big_g(X2,X2)
| ~ big_g(X0,X2) ) )
| ~ big_f(X2,X2)
| ~ big_f(X1,X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( big_f(X0,X1)
& ( ( big_g(X0,X1)
& big_f(X0,X1)
& ( ~ big_g(X2,X2)
| ~ big_g(X0,X2) ) )
| ~ big_f(X2,X2)
| ~ big_f(X1,X2) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
( big_f(X0,X1)
& ( ( big_g(X0,X1)
& big_f(X0,X1)
& ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,sK0(X0,X1)) ) )
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f4]) ).
fof(f6,plain,
! [X0,X1] : big_f(X0,X1),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( big_g(X0,X1)
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X0,X1] :
( big_f(X0,X1)
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
! [X0,X1] :
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( big_f(X0,X1)
| ~ big_f(X1,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] :
( big_g(X0,X1)
| ~ big_f(X1,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i] : big_f(X0,X1),
inference(cnf_transformation,[],[f6]) ).
tcf(c_56,negated_conjecture,
! [X0: $i,X1: $i] : big_f(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_50,c_52]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( big_g(X1,X0)
| ~ big_f(X0,sK0(X1,X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_56]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( ~ big_g(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1))
| ~ big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_56]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] : big_g(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[c_60,c_56]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( ~ big_g(X1,sK0(X1,X0))
| ~ big_f(X0,sK0(X1,X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_61,c_66]) ).
tcf(c_75,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_71,c_66,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN333+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/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 00:52:35 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.39 Running first-order theorem proving
% 0.04/0.39 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.04/0.41
% 0.04/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.41
% 0.04/0.41 % Detected problem language: tptp
% 0.04/0.42 % Proving...
% 1.14/1.27 % SZS status Started for theBenchmark.p
% 1.14/1.27 % SZS status Theorem for theBenchmark.p
% 1.14/1.27
% 1.14/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.14/1.27
% 1.14/1.27 % ------ iProver source info
% 1.14/1.27
% 1.14/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.14/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.14/1.27 % git: non_committed_changes: false
% 1.14/1.27
% 1.14/1.27 % ------ Parsing...
% 1.14/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.14/1.27
% 1.14/1.27 % ------ Preprocessing...%
% 1.14/1.27
% 1.14/1.27 % SZS status Theorem for theBenchmark.p
% 1.14/1.27
% 1.14/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.14/1.27
% 1.14/1.27
%------------------------------------------------------------------------------