%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN068+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 : n005.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:05 PM UTC 2026
% Result : Theorem 0.53s 6.29s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 57 ( 25 ~; 16 |; 14 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn 15 !; 8 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( big_f(X0)
=> ( ? [X2] :
( ~ big_h(X0,X2)
& big_g(X2) )
& ? [X1] :
( big_h(X0,X1)
& big_g(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel44_1) ).
fof(f2,axiom,
? [X0] :
( ! [X1] :
( big_g(X1)
=> big_h(X0,X1) )
& big_j(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel44_2) ).
fof(f3,conjecture,
? [X0] :
( ~ big_f(X0)
& big_j(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel44) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( ~ big_f(X0)
& big_j(X0) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
! [X0] :
( ~ big_f(X0)
| ( ? [X2] :
( ~ big_h(X0,X2)
& big_g(X2) )
& ? [X1] :
( big_h(X0,X1)
& big_g(X1) ) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f6,plain,
? [X0] :
( ! [X1] :
( ~ big_g(X1)
| big_h(X0,X1) )
& big_j(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0] :
( big_f(X0)
| ~ big_j(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
! [X0] :
( ~ big_f(X0)
| ( ~ big_h(X0,sK1(X0))
& big_g(sK1(X0))
& big_h(X0,sK0(X0))
& big_g(sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X1,sK0(X0)),skolemize(X2,sK1(X0))],[f5]) ).
fof(f9,plain,
( ! [X1] :
( ~ big_g(X1)
| big_h(sK2,X1) )
& big_j(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f6]) ).
fof(f10,plain,
! [X0] :
( ~ big_f(X0)
| ~ big_h(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0] :
( ~ big_f(X0)
| big_g(sK1(X0)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X1] :
( ~ big_g(X1)
| big_h(sK2,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
big_j(sK2),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X0] :
( big_f(X0)
| ~ big_j(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_51,plain,
! [X0: $i] :
( big_g(sK1(X0))
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_52,plain,
! [X0: $i] :
( ~ big_f(X0)
| ~ big_h(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_53,plain,
big_j(sK2),
inference(cnf_transformation,[],[f15]) ).
tcf(c_54,plain,
! [X0: $i] :
( big_h(sK2,X0)
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] :
( big_f(X0)
| ~ big_j(X0) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_56,plain,
( big_f(sK2)
| ~ big_j(sK2) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_58,plain,
( big_g(sK1(sK2))
| ~ big_f(sK2) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_93,plain,
( ~ big_f(sK2)
| ~ big_g(sK1(sK2)) ),
inference(resolution,[status(thm)],[c_52,c_54]) ).
tcf(c_94,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_93,c_58,c_56,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN068+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/5.38 % Computer : n005.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Fri Sep 25 00:02:37 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/5.42 Running first-order theorem proving
% 0.16/5.42 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.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.45 % Proving...
% 0.53/6.29 % SZS status Started for theBenchmark.p
% 0.53/6.29 % SZS status Theorem for theBenchmark.p
% 0.53/6.29
% 0.53/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.53/6.29
% 0.53/6.29 % ------ iProver source info
% 0.53/6.29
% 0.53/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.53/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.53/6.29 % git: non_committed_changes: false
% 0.53/6.29
% 0.53/6.29 % ------ Parsing...
% 0.53/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.53/6.29
% 0.53/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s%
% 0.53/6.29
% 0.53/6.29 % SZS status Theorem for theBenchmark.p
% 0.53/6.29
% 0.53/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.53/6.29
% 0.53/6.29
%------------------------------------------------------------------------------