%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN944+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 : n011.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:29 PM UTC 2026
% Result : Theorem 1.02s 1.18s
% Output : CNFRefutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 105 ( 36 ~; 25 |; 35 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 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 : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 71 ( 0 sgn 56 !; 15 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1,X2] :
( ( ! [X3,X4] :
( r(X3,X4)
=> q(X3,X4) )
& ! [X3] :
( s(X3)
=> p(X3) )
& r(X1,X2)
& s(X1)
& s(X0) )
=> ? [X3,X4] :
( q(X3,X4)
& p(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ! [X3,X4] :
( r(X3,X4)
=> q(X3,X4) )
& ! [X3] :
( s(X3)
=> p(X3) )
& r(X1,X2)
& s(X1)
& s(X0) )
=> ? [X3,X4] :
( q(X3,X4)
& p(X3) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ! [X0,X1,X2] :
( ( ! [X4,X5] :
( r(X4,X5)
=> q(X4,X5) )
& ! [X3] :
( s(X3)
=> p(X3) )
& r(X1,X2)
& s(X1)
& s(X0) )
=> ? [X6,X7] :
( q(X6,X7)
& p(X6) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0,X1,X2] :
( ! [X4,X5] :
( ~ r(X4,X5)
| q(X4,X5) )
& ! [X3] :
( ~ s(X3)
| p(X3) )
& r(X1,X2)
& s(X1)
& s(X0)
& ! [X6,X7] :
( ~ q(X6,X7)
| ~ p(X6) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0,X1,X2] :
( ! [X4,X5] :
( ~ r(X4,X5)
| q(X4,X5) )
& ! [X3] :
( ~ s(X3)
| p(X3) )
& r(X1,X2)
& s(X1)
& s(X0)
& ! [X6,X7] :
( ~ q(X6,X7)
| ~ p(X6) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
? [X0,X1,X2] :
( ! [X6,X7] :
( ~ r(X6,X7)
| q(X6,X7) )
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(X1,X2)
& s(X1)
& s(X0)
& ! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X6,X7] :
( ~ r(X6,X7)
| q(X6,X7) )
& ! [X5] :
( ~ s(X5)
| p(X5) )
& r(sK1,sK2)
& s(sK1)
& s(sK0)
& ! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).
fof(f8,plain,
! [X6,X7] :
( ~ r(X6,X7)
| q(X6,X7) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X5] :
( ~ s(X5)
| p(X5) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
r(sK1,sK2),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
s(sK1),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ p(X0)
| ~ q(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_51,negated_conjecture,
s(sK1),
inference(cnf_transformation,[],[f11]) ).
tcf(c_52,negated_conjecture,
r(sK1,sK2),
inference(cnf_transformation,[],[f10]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( p(X0)
| ~ s(X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_54,negated_conjecture,
! [X0: $i,X1: $i] :
( q(X0,X1)
| ~ r(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_55,plain,
( p(sK1)
| ~ s(sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_58,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1,X0_iProver_q_2: iProver_q_2] :
( q(X0_iProver_p_1,X0_iProver_q_2)
| ~ r(X0_iProver_p_1,X0_iProver_q_2) ),
inference(subtyping,[status(esa)],[c_54]) ).
tcf(c_63,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1,X0_iProver_q_2: iProver_q_2] :
( ~ p(X0_iProver_p_1)
| ~ q(X0_iProver_p_1,X0_iProver_q_2) ),
inference(subtyping,[status(esa)],[c_49]) ).
tcf(c_64,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1,X0_iProver_q_2: iProver_q_2] :
( ~ p(X0_iProver_p_1)
| ~ q(X0_iProver_p_1,X0_iProver_q_2) ),
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_69,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1,X0_iProver_q_2: iProver_q_2] :
( q(X0_iProver_p_1,X0_iProver_q_2)
| ~ r(X0_iProver_p_1,X0_iProver_q_2) ),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_70,plain,
( q(sK1,sK2)
| ~ r(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_71,plain,
( ~ p(sK1)
| ~ q(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_72,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_71,c_70,c_55,c_52,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN944+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.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 02:37:13 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.02/1.18 % SZS status Started for theBenchmark.p
% 1.02/1.18 % SZS status Theorem for theBenchmark.p
% 1.02/1.18
% 1.02/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.02/1.18
% 1.02/1.18 % ------ iProver source info
% 1.02/1.18
% 1.02/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.02/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.02/1.18 % git: non_committed_changes: false
% 1.02/1.18
% 1.02/1.18 % ------ Parsing...
% 1.02/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.02/1.18 %
% 1.02/1.18
% 1.02/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 1.02/1.18
% 1.02/1.18 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 1.02/1.18 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.02/1.18 % ------ Proving...
% 1.02/1.18 % ------ Problem Properties
% 1.02/1.18
% 1.02/1.18 %
% 1.02/1.18 % clauses 6
% 1.02/1.18 % conjectures 6
% 1.02/1.18 % EPR 6
% 1.02/1.18 % Horn 6
% 1.02/1.18 % unary 3
% 1.02/1.18 % binary 3
% 1.02/1.18 % lits 9
% 1.02/1.18 % lits eq 0
% 1.02/1.18 % fd_pure 0
% 1.02/1.18 % fd_pseudo 0
% 1.02/1.18 % fd_cond 0
% 1.02/1.18 % fd_pseudo_cond 0
% 1.02/1.18 % AC symbols 0
% 1.02/1.18
% 1.02/1.18 % ------ Schedule EPR Horn non eq is on
% 1.02/1.18
% 1.02/1.18 % ------ no equalities: superposition off
% 1.02/1.18
% 1.02/1.18 % ------ Option_epr_horn Time Limit: Unbounded
% 1.02/1.18
% 1.02/1.18
% 1.02/1.18 % ------
% 1.02/1.18 % Current options:
% 1.02/1.18 % ------
% 1.02/1.18
% 1.02/1.18
% 1.02/1.18 %
% 1.02/1.18
% 1.02/1.18 % ------ Proving...
% 1.02/1.18 %
% 1.02/1.18
% 1.02/1.18 % SZS status Theorem for theBenchmark.p
% 1.02/1.18
% 1.02/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.02/1.18
% 1.02/1.18
%------------------------------------------------------------------------------