%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN979+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 : n019.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:34 PM UTC 2026
% Result : Theorem 0.51s 6.29s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 9 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 74 ( 17 ~; 11 |; 38 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 20 !; 8 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
( ( s(X0)
& ( s(X0)
=> p(X2,X3) )
& r(X1)
& r(X0)
& ( r(X3)
=> p(X1,X3) )
& q(X1)
& q(X0)
& ( q(X2)
=> p(X2,X0) ) )
=> p(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
( ( s(X0)
& ( s(X0)
=> p(X2,X3) )
& r(X1)
& r(X0)
& ( r(X3)
=> p(X1,X3) )
& q(X1)
& q(X0)
& ( q(X2)
=> p(X2,X0) ) )
=> p(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
( s(X0)
& ( ~ s(X0)
| p(X2,X3) )
& r(X1)
& r(X0)
& ( ~ r(X3)
| p(X1,X3) )
& q(X1)
& q(X0)
& ( ~ q(X2)
| p(X2,X0) )
& ~ p(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
( s(X0)
& ( ~ s(X0)
| p(X2,X3) )
& r(X1)
& r(X0)
& ( ~ r(X3)
| p(X1,X3) )
& q(X1)
& q(X0)
& ( ~ q(X2)
| p(X2,X0) )
& ~ p(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X2,X3] :
( s(sK0)
& ( ~ s(sK0)
| p(X2,X3) )
& r(sK1)
& r(sK0)
& ( ~ r(X3)
| p(sK1,X3) )
& q(sK1)
& q(sK0)
& ( ~ q(X2)
| p(X2,sK0) )
& ~ p(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).
fof(f6,plain,
s(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X2,X3] :
( ~ s(sK0)
| p(X2,X3) ),
inference(cnf_transformation,[],[f5]) ).
fof(f14,plain,
~ p(sK0,sK1),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
~ p(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
tcf(c_56,negated_conjecture,
! [X0: $i,X1: $i] :
( p(X0,X1)
| ~ s(sK0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_57,negated_conjecture,
s(sK0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_61,negated_conjecture,
! [X0: $i,X1: $i] : p(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_56,c_57,c_56]) ).
tcf(c_64,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1,X0_iProver_p_2: iProver_p_2] : p(X0_iProver_p_1,X0_iProver_p_2),
inference(subtyping,[status(esa)],[c_61]) ).
tcf(c_67,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1,X0_iProver_p_2: iProver_p_2] : p(X0_iProver_p_1,X0_iProver_p_2),
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_68,plain,
p(sK0,sK1),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_69,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_68,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN979+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/5.38 % Computer : n019.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Fri Sep 25 02:42:43 UTC 2026
% 0.09/5.39 % CPUTime :
% 0.09/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 0.51/6.29 % SZS status Started for theBenchmark.p
% 0.51/6.29 % SZS status Theorem for theBenchmark.p
% 0.51/6.29
% 0.51/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.51/6.29
% 0.51/6.29 % ------ iProver source info
% 0.51/6.29
% 0.51/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.51/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.51/6.29 % git: non_committed_changes: false
% 0.51/6.29
% 0.51/6.29 % ------ Parsing...
% 0.51/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 0.51/6.29 %
% 0.51/6.29
% 0.51/6.29 % ------ Preprocessing... sf_s rm: 7 0s sf_e sf_s rm: 0 0s sf_e %
% 0.51/6.29
% 0.51/6.29 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 0.51/6.29 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.51/6.29 % ------ Proving...
% 0.51/6.29 % ------ Problem Properties
% 0.51/6.29
% 0.51/6.29 %
% 0.51/6.29 % clauses 2
% 0.51/6.29 % conjectures 2
% 0.51/6.29 % EPR 2
% 0.51/6.29 % Horn 2
% 0.51/6.29 % unary 2
% 0.51/6.29 % binary 0
% 0.51/6.29 % lits 2
% 0.51/6.29 % lits eq 0
% 0.51/6.29 % fd_pure 0
% 0.51/6.29 % fd_pseudo 0
% 0.51/6.29 % fd_cond 0
% 0.51/6.29 % fd_pseudo_cond 0
% 0.51/6.29 % AC symbols 0
% 0.51/6.29
% 0.51/6.29 % ------ Schedule EPR Horn non eq is on
% 0.51/6.29
% 0.51/6.29 % ------ no equalities: superposition off
% 0.51/6.29
% 0.51/6.29 % ------ Option_epr_horn Time Limit: Unbounded
% 0.51/6.29
% 0.51/6.29
% 0.51/6.29 % ------
% 0.51/6.29 % Current options:
% 0.51/6.29 % ------
% 0.51/6.29
% 0.51/6.29
% 0.51/6.29 %
% 0.51/6.29
% 0.51/6.29 % ------ Proving...
% 0.51/6.29 %
% 0.51/6.29
% 0.51/6.29 % SZS status Theorem for theBenchmark.p
% 0.51/6.29
% 0.51/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.51/6.29
% 0.51/6.29
%------------------------------------------------------------------------------