%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN920+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n003.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:45:25 PM UTC 2026
% Result : Theorem 0.52s 1.29s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 5 unt; 0 def)
% Number of atoms : 162 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 196 ( 67 ~; 66 |; 42 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% 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 : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 48 ( 0 sgn 36 !; 12 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ( ! [X2] :
( f(X2)
=> h(X2) )
| ! [X1] :
( f(X1)
=> g(X1) ) )
& ( ! [X0] :
( ( g(X0)
& f(X0) )
=> h(X0) )
=> ? [X0] :
( ~ g(X0)
& f(X0) ) ) )
=> ( ! [X3] :
( ( h(X3)
& f(X3) )
=> g(X3) )
=> ? [X4] :
( ~ h(X4)
& g(X4)
& f(X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ( ( ! [X2] :
( f(X2)
=> h(X2) )
| ! [X1] :
( f(X1)
=> g(X1) ) )
& ( ! [X0] :
( ( g(X0)
& f(X0) )
=> h(X0) )
=> ? [X0] :
( ~ g(X0)
& f(X0) ) ) )
=> ( ! [X3] :
( ( h(X3)
& f(X3) )
=> g(X3) )
=> ? [X4] :
( ~ h(X4)
& g(X4)
& f(X4) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ( ! [X3] :
( f(X3)
=> h(X3) )
| ! [X2] :
( f(X2)
=> g(X2) ) )
& ( ! [X0] :
( ( g(X0)
& f(X0) )
=> h(X0) )
=> ? [X1] :
( ~ g(X1)
& f(X1) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ( ! [X3] :
( ~ f(X3)
| h(X3) )
| ! [X2] :
( ~ f(X2)
| g(X2) ) )
& ( ? [X0] :
( g(X0)
& f(X0)
& ~ h(X0) )
| ? [X1] :
( ~ g(X1)
& f(X1) ) )
& ! [X4] :
( ~ h(X4)
| ~ f(X4)
| g(X4) )
& ! [X5] :
( h(X5)
| ~ g(X5)
| ~ f(X5) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X3] :
( ~ f(X3)
| h(X3) )
| ! [X2] :
( ~ f(X2)
| g(X2) ) )
& ( ? [X0] :
( g(X0)
& f(X0)
& ~ h(X0) )
| ? [X1] :
( ~ g(X1)
& f(X1) ) )
& ! [X4] :
( ~ h(X4)
| ~ f(X4)
| g(X4) )
& ! [X5] :
( h(X5)
| ~ g(X5)
| ~ f(X5) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ( ! [X5] :
( ~ f(X5)
| h(X5) )
| ! [X4] :
( ~ f(X4)
| g(X4) ) )
& ( ? [X3] :
( g(X3)
& f(X3)
& ~ h(X3) )
| ? [X2] :
( ~ g(X2)
& f(X2) ) )
& ! [X1] :
( ~ h(X1)
| ~ f(X1)
| g(X1) )
& ! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ( ! [X5] :
( ~ f(X5)
| h(X5) )
| ! [X4] :
( ~ f(X4)
| g(X4) ) )
& ( ( g(sK1)
& f(sK1)
& ~ h(sK1) )
| ( ~ g(sK0)
& f(sK0) ) )
& ! [X1] :
( ~ h(X1)
| ~ f(X1)
| g(X1) )
& ! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f6]) ).
fof(f8,plain,
! [X4,X5] :
( ~ f(X5)
| h(X5)
| ~ f(X4)
| g(X4) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
( g(sK1)
| ~ g(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
( f(sK1)
| ~ g(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
( ~ h(sK1)
| ~ g(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
( g(sK1)
| f(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
( f(sK1)
| f(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f14,plain,
( ~ h(sK1)
| f(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X1] :
( ~ h(X1)
| ~ f(X1)
| g(X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( h(X0)
| ~ g(X0)
| ~ f(X0) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( g(X0)
| ~ h(X0)
| ~ f(X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_51,negated_conjecture,
( f(sK0)
| ~ h(sK1) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_52,negated_conjecture,
( f(sK1)
| f(sK0) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,negated_conjecture,
( g(sK1)
| f(sK0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_54,negated_conjecture,
( ~ h(sK1)
| ~ g(sK0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_55,negated_conjecture,
( f(sK1)
| ~ g(sK0) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_56,negated_conjecture,
( g(sK1)
| ~ g(sK0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_57,negated_conjecture,
! [X0: $i,X1: $i] :
( h(X1)
| g(X0)
| ~ f(X1)
| ~ f(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_58,plain,
( g(sK0)
| ~ h(sK0)
| ~ f(sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_60,plain,
( h(sK0)
| g(sK0)
| ~ f(sK0) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_61,negated_conjecture,
g(sK1),
inference(global_subsumption_just,[status(thm)],[c_53,c_53,c_56,c_58,c_60]) ).
tcf(c_63,negated_conjecture,
f(sK1),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_55,c_58,c_60]) ).
tcf(c_65,negated_conjecture,
g(sK1),
inference(global_subsumption_just,[status(thm)],[c_56,c_61]) ).
tcf(c_69,negated_conjecture,
~ h(sK1),
inference(global_subsumption_just,[status(thm)],[c_51,c_51,c_54,c_58,c_60]) ).
tcf(c_114,plain,
( h(sK1)
| ~ f(sK1) ),
inference(resolution,[status(thm)],[c_49,c_65]) ).
tcf(c_115,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_114,c_69,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN920+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n003.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Fri Sep 25 02:36:07 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.43
% 0.09/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 0.52/1.29 % SZS status Started for theBenchmark.p
% 0.52/1.29 % SZS status Theorem for theBenchmark.p
% 0.52/1.29
% 0.52/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.52/1.29
% 0.52/1.29 % ------ iProver source info
% 0.52/1.29
% 0.52/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.52/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.52/1.29 % git: non_committed_changes: false
% 0.52/1.29
% 0.52/1.29 % ------ Parsing...
% 0.52/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.52/1.29 %
% 0.52/1.29
% 0.52/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s %
% 0.52/1.29
% 0.52/1.29 % SZS status Theorem for theBenchmark.p
% 0.52/1.29
% 0.52/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.52/1.29
% 0.52/1.29
%------------------------------------------------------------------------------