%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN729-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n012.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:41:30 PM UTC 2026
% Result : Unsatisfiable 0.93s 1.07s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 11 unt; 3 def)
% Number of atoms : 58 ( 3 equ)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 39 ( 22 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0] :
( ~ p(X0)
| l(X0,g(h(sk1(X0)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_1) ).
fof(f2,negated_conjecture,
! [X0] :
( ~ p(X0)
| p(sk1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_2) ).
fof(f3,negated_conjecture,
! [X0] :
( ~ p(X0)
| p(g(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_3) ).
fof(f4,negated_conjecture,
! [X0] :
( ~ p(X0)
| p(h(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_4) ).
fof(f5,negated_conjecture,
p(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_5) ).
fof(f6,negated_conjecture,
! [X0] :
( ~ l(sk2,X0)
| ~ p(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72_6) ).
tcf(c_55,negated_conjecture,
! [X0: $i] :
( l(X0,g(h(sk1(X0))))
| ~ p(X0) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,negated_conjecture,
! [X0: $i] :
( p(sk1(X0))
| ~ p(X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,negated_conjecture,
! [X0: $i] :
( p(g(X0))
| ~ p(X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] :
( p(h(X0))
| ~ p(X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,negated_conjecture,
p(sk2),
inference(cnf_transformation,[],[f5]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] :
( ~ p(X0)
| ~ l(sk2,X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_88,plain,
( ~ p(sk2)
| ~ p(g(h(sk1(sk2)))) ),
inference(resolution,[status(thm)],[c_55,c_60]) ).
tcf(c_89,plain,
~ p(g(h(sk1(sk2)))),
inference(global_subsumption_just,[status(thm)],[c_88,c_59,c_88]) ).
tcf(c_111,definition,
iPr_def_10 = sk1(sk2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_112,definition,
iPr_def_11 = h(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_113,definition,
iPr_def_12 = g(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_114,plain,
~ p(iPr_def_12),
inference(demodulation,[status(thm)],[c_89,c_111,c_112,c_113]) ).
tcf(c_115,negated_conjecture,
p(sk2),
inference(demodulation,[status(thm)],[c_59]) ).
tcf(c_116,negated_conjecture,
! [X0: $i] :
( p(h(X0))
| ~ p(X0) ),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_117,negated_conjecture,
! [X0: $i] :
( p(g(X0))
| ~ p(X0) ),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_118,negated_conjecture,
! [X0: $i] :
( p(sk1(X0))
| ~ p(X0) ),
inference(demodulation,[status(thm)],[c_56]) ).
tcf(c_239,plain,
( p(iPr_def_10)
| ~ p(sk2) ),
inference(superposition,[status(thm)],[c_111,c_118]) ).
tcf(c_240,plain,
p(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_239,c_115]) ).
tcf(c_241,plain,
( p(iPr_def_11)
| ~ p(iPr_def_10) ),
inference(superposition,[status(thm)],[c_112,c_116]) ).
tcf(c_242,plain,
p(iPr_def_11),
inference(forward_subsumption_resolution,[status(thm)],[c_241,c_240]) ).
tcf(c_243,plain,
( p(iPr_def_12)
| ~ p(iPr_def_11) ),
inference(superposition,[status(thm)],[c_113,c_117]) ).
tcf(c_244,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_243,c_114,c_242]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN729-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Fri Sep 25 02:12:50 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.03/0.33
% 0.03/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.33
% 0.03/0.33 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 0.93/1.07 % SZS status Started for theBenchmark.p
% 0.93/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 0.93/1.07
% 0.93/1.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.93/1.07
% 0.93/1.07 % ------ iProver source info
% 0.93/1.07
% 0.93/1.07 % git: date: 2026-07-19 20:42:38 +0200
% 0.93/1.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.93/1.07 % git: non_committed_changes: false
% 0.93/1.07
% 0.93/1.07 % ------ Parsing...% successful
% 0.93/1.07
% 0.93/1.07
% 0.93/1.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.93/1.07
% 0.93/1.07 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.93/1.07
% 0.93/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.93/1.07
% 0.93/1.07 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.93/1.07 % ------ Proving...
% 0.93/1.07 % ------ Problem Properties
% 0.93/1.07
% 0.93/1.07 %
% 0.93/1.07 % clauses 8
% 0.93/1.07 % conjectures 4
% 0.93/1.07 % EPR 2
% 0.93/1.07 % Horn 8
% 0.93/1.07 % unary 5
% 0.93/1.07 % binary 3
% 0.93/1.07 % lits 11
% 0.93/1.07 % lits eq 3
% 0.93/1.07 % fd_pure 0
% 0.93/1.07 % fd_pseudo 0
% 0.93/1.07 % fd_cond 0
% 0.93/1.07 % fd_pseudo_cond 0
% 0.93/1.07 % AC symbols 0
% 0.93/1.07
% 0.93/1.07 % ------ Schedule dynamic 5 is on
% 0.93/1.07
% 0.93/1.07 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.93/1.07
% 0.93/1.07
% 0.93/1.07 % ------
% 0.93/1.07 % Current options:
% 0.93/1.07 % ------
% 0.93/1.07
% 0.93/1.07
% 0.93/1.07 %
% 0.93/1.07
% 0.93/1.07 % ------ Proving...
% 0.93/1.07 %
% 0.93/1.07
% 0.93/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 0.93/1.07
% 0.93/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.93/1.07
% 0.93/1.07
%------------------------------------------------------------------------------