%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN000_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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:38:49 PM UTC 2026
% Result : Theorem 1.17s 1.27s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 10 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 90 ( 36 ~; 33 |; 16 &)
% ( 2 <=>; 1 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 4 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 20 !; 12 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_1,type,
$bool: $tType ).
tff(type_def_5,type,
new: $tType ).
tff(func_def_8,type,
newc: new ).
tff(func_def_9,type,
newf: ( $i * new ) > new ).
tff(pred_def_11,type,
newp: ( $i * new ) > $o ).
fof(f6,axiom,
! [X0] :
( ( ~ q(X0,a)
=> p(X0) )
<=> ? [X1,X2] :
( r(X0,f(X1),g(X0,f(X1),X2))
<~> ~ s(f(f(f(b)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',useful_connectives) ).
fof(f9,axiom,
p(h),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',role_hypothesis) ).
fof(f10,conjecture,
? [X0] : p(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',role_conjecture) ).
fof(f11,negated_conjecture,
~ ? [X0] : p(X0),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f24,plain,
! [X0] :
( ( q(X0,a)
| p(X0) )
<=> ? [X1,X2] :
( r(X0,f(X1),g(X0,f(X1),X2))
<~> ~ s(f(f(f(b)))) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f26,plain,
! [X0] : ~ p(X0),
inference(ennf_transformation,[],[f11]) ).
fof(f29,plain,
! [X0] :
( ( ( ~ q(X0,a)
& ~ p(X0) )
| ? [X1,X2] :
( ( r(X0,f(X1),g(X0,f(X1),X2))
| ~ s(f(f(f(b)))) )
& ( ~ r(X0,f(X1),g(X0,f(X1),X2))
| s(f(f(f(b)))) ) ) )
& ( ! [X1,X2] :
( ( ~ r(X0,f(X1),g(X0,f(X1),X2))
| ~ s(f(f(f(b)))) )
& ( s(f(f(f(b))))
| r(X0,f(X1),g(X0,f(X1),X2)) ) )
| q(X0,a)
| p(X0) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f30,plain,
! [X0] :
( ( ( ~ q(X0,a)
& ~ p(X0) )
| ? [X1,X2] :
( ( r(X0,f(X1),g(X0,f(X1),X2))
| ~ s(f(f(f(b)))) )
& ( ~ r(X0,f(X1),g(X0,f(X1),X2))
| s(f(f(f(b)))) ) ) )
& ( ! [X1,X2] :
( ( ~ r(X0,f(X1),g(X0,f(X1),X2))
| ~ s(f(f(f(b)))) )
& ( s(f(f(f(b))))
| r(X0,f(X1),g(X0,f(X1),X2)) ) )
| q(X0,a)
| p(X0) ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ( ( ~ q(X0,a)
& ~ p(X0) )
| ? [X3,X4] :
( ( r(X0,f(X3),g(X0,f(X3),X4))
| ~ s(f(f(f(b)))) )
& ( ~ r(X0,f(X3),g(X0,f(X3),X4))
| s(f(f(f(b)))) ) ) )
& ( ! [X1,X2] :
( ( ~ r(X0,f(X1),g(X0,f(X1),X2))
| ~ s(f(f(f(b)))) )
& ( s(f(f(f(b))))
| r(X0,f(X1),g(X0,f(X1),X2)) ) )
| q(X0,a)
| p(X0) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0] :
( ( ( ~ q(X0,a)
& ~ p(X0) )
| ( ( r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0)))
| ~ s(f(f(f(b)))) )
& ( ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0)))
| s(f(f(f(b)))) ) ) )
& ( ! [X1,X2] :
( ( ~ r(X0,f(X1),g(X0,f(X1),X2))
| ~ s(f(f(f(b)))) )
& ( s(f(f(f(b))))
| r(X0,f(X1),g(X0,f(X1),X2)) ) )
| q(X0,a)
| p(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X3,sK3(X0)),skolemize(X4,sK4(X0))],[f31]) ).
fof(f42,plain,
! [X0] :
( ~ p(X0)
| ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0)))
| s(f(f(f(b)))) ),
inference(cnf_transformation,[],[f32]) ).
fof(f49,plain,
p(h),
inference(cnf_transformation,[],[f9]) ).
fof(f50,plain,
! [X0] : ~ p(X0),
inference(cnf_transformation,[],[f26]) ).
tcf(c_56,plain,
! [X0: $i] :
( s(f(f(f(b))))
| ~ p(X0)
| ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_64,plain,
p(h),
inference(cnf_transformation,[],[f49]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] : ~ p(X0),
inference(cnf_transformation,[],[f50]) ).
tcf(c_88,plain,
! [X0: $i] : ~ p(X0),
inference(global_subsumption_just,[status(thm)],[c_56,c_65]) ).
tcf(c_96,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_64,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN000_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 23:44:01 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.17/1.27 % SZS status Started for theBenchmark.p
% 1.17/1.27 % SZS status Theorem for theBenchmark.p
% 1.17/1.27
% 1.17/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.17/1.27
% 1.17/1.27 % ------ iProver source info
% 1.17/1.27
% 1.17/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.17/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.17/1.27 % git: non_committed_changes: false
% 1.17/1.27
% 1.17/1.27 % ------ Parsing...
% 1.17/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 1.17/1.27 %
% 1.17/1.27
% 1.17/1.27 % ------ Preprocessing...%
% 1.17/1.27
% 1.17/1.27 % SZS status Theorem for theBenchmark.p
% 1.17/1.27
% 1.17/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.17/1.27
% 1.17/1.27
%------------------------------------------------------------------------------