%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN970+1 : TPTP v9.3.1. Released v3.1.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:45:32 PM UTC 2026
% Result : Theorem 0.43s 1.28s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 21 ~; 14 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 7 ( 6 usr; 5 prp; 0-1 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] :
( ( p(X2)
=> r(X3) )
=> ( p(X0)
=> r(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
( ( p(X2)
=> r(X3) )
=> ( p(X0)
=> r(X1) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
( ( ~ p(X2)
| r(X3) )
& p(X0)
& ~ r(X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
( ( ~ p(X2)
| r(X3) )
& p(X0)
& ~ r(X1) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X2,X3] :
( ( ~ p(X2)
| r(X3) )
& p(sK0)
& ~ r(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).
fof(f6,plain,
! [X2,X3] :
( ~ p(X2)
| r(X3) ),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
p(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
~ r(sK1),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
~ r(sK1),
inference(cnf_transformation,[],[f8]) ).
tcf(c_50,negated_conjecture,
p(sK0),
inference(cnf_transformation,[],[f7]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] :
( r(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_53,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1,X0_iProver_r_1: iProver_r_1] :
( r(X0_iProver_r_1)
| ~ p(X0_iProver_p_1) ),
inference(subtyping,[status(esa)],[c_51]) ).
tcf(c_56,negated_conjecture,
! [X0_iProver_r_1: iProver_r_1] :
( ~ iPr_def_10
| r(X0_iProver_r_1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_53]) ).
tcf(c_57,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1] :
( ~ iPr_def_11
| ~ p(X0_iProver_p_1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_53]) ).
tcf(c_58,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).
tcf(c_61,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_62,negated_conjecture,
! [X0_iProver_p_1: iProver_p_1] :
( ~ iPr_def_11
| ~ p(X0_iProver_p_1) ),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_63,negated_conjecture,
! [X0_iProver_r_1: iProver_r_1] :
( r(X0_iProver_r_1)
| ~ iPr_def_10 ),
inference(demodulation,[status(thm)],[c_56]) ).
tcf(c_64,plain,
( r(sK1)
| ~ iPr_def_10 ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_65,plain,
( ~ iPr_def_11
| ~ p(sK0) ),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_66,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_65,c_64,c_61,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN970+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 02:36:16 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.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.43 % Proving...
% 0.43/1.28 % SZS status Started for theBenchmark.p
% 0.43/1.28 % SZS status Theorem for theBenchmark.p
% 0.43/1.28
% 0.43/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.43/1.28
% 0.43/1.28 % ------ iProver source info
% 0.43/1.28
% 0.43/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.43/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.43/1.28 % git: non_committed_changes: false
% 0.43/1.28
% 0.43/1.28 % ------ Parsing...
% 0.43/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 0.43/1.28 %
% 0.43/1.28
% 0.43/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 0.43/1.28
% 0.43/1.28 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 0.43/1.28 gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.28 % ------ Proving...
% 0.43/1.28 % ------ Problem Properties
% 0.43/1.28
% 0.43/1.28 %
% 0.43/1.28 % clauses 5
% 0.43/1.28 % conjectures 5
% 0.43/1.28 % EPR 5
% 0.43/1.28 % Horn 4
% 0.43/1.28 % unary 2
% 0.43/1.28 % binary 3
% 0.43/1.28 % lits 8
% 0.43/1.28 % lits eq 0
% 0.43/1.28 % fd_pure 0
% 0.43/1.28 % fd_pseudo 0
% 0.43/1.28 % fd_cond 0
% 0.43/1.28 % fd_pseudo_cond 0
% 0.43/1.28 % AC symbols 0
% 0.43/1.28
% 0.43/1.28 % ------ Schedule EPR non Horn non eq is on
% 0.43/1.28
% 0.43/1.28 % ------ no equalities: superposition off
% 0.43/1.28
% 0.43/1.28 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 0.43/1.28
% 0.43/1.28
% 0.43/1.28 % ------
% 0.43/1.28 % Current options:
% 0.43/1.28 % ------
% 0.43/1.28
% 0.43/1.28
% 0.43/1.28 %
% 0.43/1.28
% 0.43/1.28 % ------ Proving...
% 0.43/1.28 %
% 0.43/1.28
% 0.43/1.28 % SZS status Theorem for theBenchmark.p
% 0.43/1.28
% 0.43/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.28
% 0.43/1.28
%------------------------------------------------------------------------------