%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN922+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 : n015.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:26 PM UTC 2026
% Result : Theorem 1.47s 1.26s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 96 ( 36 ~; 36 |; 20 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 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 : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 49 ( 0 sgn 40 !; 9 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( q(X0)
& p(X0) )
<=> ( ! [X0] : q(X0)
& ! [X0] : p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( q(X0)
& p(X0) )
<=> ( ! [X0] : q(X0)
& ! [X0] : p(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( q(X0)
& p(X0) )
<=> ( ! [X2] : q(X2)
& ! [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( q(X0)
& p(X0) )
<~> ( ! [X2] : q(X2)
& ! [X1] : p(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X0] :
( q(X0)
& p(X0) )
| ( ! [X2] : q(X2)
& ! [X1] : p(X1) ) )
& ( ? [X0] :
( ~ q(X0)
| ~ p(X0) )
| ? [X2] : ~ q(X2)
| ? [X1] : ~ p(X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ! [X0] :
( q(X0)
& p(X0) )
| ( ! [X2] : q(X2)
& ! [X1] : p(X1) ) )
& ( ? [X0] :
( ~ q(X0)
| ~ p(X0) )
| ? [X2] : ~ q(X2)
| ? [X1] : ~ p(X1) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ! [X5] :
( q(X5)
& p(X5) )
| ( ! [X4] : q(X4)
& ! [X3] : p(X3) ) )
& ( ? [X2] :
( ~ q(X2)
| ~ p(X2) )
| ? [X1] : ~ q(X1)
| ? [X0] : ~ p(X0) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ( ! [X5] :
( q(X5)
& p(X5) )
| ( ! [X4] : q(X4)
& ! [X3] : p(X3) ) )
& ( ~ q(sK2)
| ~ p(sK2)
| ~ q(sK1)
| ~ p(sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f7]) ).
fof(f9,plain,
! [X4,X5] :
( q(X5)
| q(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X4,X5] :
( p(X5)
| q(X4) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X3,X5] :
( p(X5)
| p(X3) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
( ~ q(sK2)
| ~ p(sK2)
| ~ q(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,negated_conjecture,
( ~ q(sK2)
| ~ q(sK1)
| ~ p(sK2)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( p(X1)
| p(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i] :
( q(X1)
| p(X0) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_53,negated_conjecture,
! [X0: $i,X1: $i] :
( q(X1)
| q(X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_54,plain,
q(sK2),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_55,plain,
p(sK2),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_56,plain,
( ~ p(sK0)
| ~ q(sK1) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_54,c_55,c_49]) ).
tcf(c_57,negated_conjecture,
( ~ q(sK1)
| ~ p(sK0) ),
inference(renaming,[status(thm)],[c_56]) ).
tcf(c_90,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| q(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_53]) ).
tcf(c_91,negated_conjecture,
iPr_def_10,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_53]) ).
tcf(c_92,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| p(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_52]) ).
tcf(c_94,negated_conjecture,
iPr_def_11,
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_50]) ).
tcf(c_96,negated_conjecture,
iPr_def_10,
inference(demodulation,[status(thm)],[c_91]) ).
tcf(c_101,negated_conjecture,
! [X0: $i] :
( q(X0)
| ~ iPr_def_10 ),
inference(demodulation,[status(thm)],[c_90]) ).
tcf(c_102,negated_conjecture,
iPr_def_11,
inference(demodulation,[status(thm)],[c_94]) ).
tcf(c_104,negated_conjecture,
! [X0: $i] :
( p(X0)
| ~ iPr_def_11 ),
inference(demodulation,[status(thm)],[c_92]) ).
tcf(c_105,plain,
( q(sK1)
| ~ iPr_def_10 ),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_106,plain,
( p(sK0)
| ~ iPr_def_11 ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_107,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_106,c_105,c_102,c_96,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN922+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.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 02:37:41 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 1.47/1.26 % SZS status Started for theBenchmark.p
% 1.47/1.26 % SZS status Theorem for theBenchmark.p
% 1.47/1.26
% 1.47/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.47/1.26
% 1.47/1.26 % ------ iProver source info
% 1.47/1.26
% 1.47/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.47/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.47/1.26 % git: non_committed_changes: false
% 1.47/1.26
% 1.47/1.26 % ------ Parsing...
% 1.47/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.47/1.26 %
% 1.47/1.26
% 1.47/1.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.47/1.26
% 1.47/1.26 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.47/1.26 gs_s sp: 6 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.47/1.26 % ------ Proving...
% 1.47/1.26 % ------ Problem Properties
% 1.47/1.26
% 1.47/1.26 %
% 1.47/1.26 % clauses 6
% 1.47/1.26 % conjectures 6
% 1.47/1.26 % EPR 6
% 1.47/1.26 % Horn 5
% 1.47/1.26 % unary 2
% 1.47/1.26 % binary 4
% 1.47/1.26 % lits 10
% 1.47/1.26 % lits eq 0
% 1.47/1.26 % fd_pure 0
% 1.47/1.26 % fd_pseudo 0
% 1.47/1.26 % fd_cond 0
% 1.47/1.26 % fd_pseudo_cond 0
% 1.47/1.26 % AC symbols 0
% 1.47/1.26
% 1.47/1.26 % ------ Schedule EPR non Horn non eq is on
% 1.47/1.26
% 1.47/1.26 % ------ no equalities: superposition off
% 1.47/1.26
% 1.47/1.26 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.47/1.26
% 1.47/1.26
% 1.47/1.26 % ------
% 1.47/1.26 % Current options:
% 1.47/1.26 % ------
% 1.47/1.26
% 1.47/1.26
% 1.47/1.26 %
% 1.47/1.26
% 1.47/1.26 % ------ Proving...
% 1.47/1.26 %
% 1.47/1.26
% 1.47/1.26 % SZS status Theorem for theBenchmark.p
% 1.47/1.26
% 1.47/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.47/1.26
% 1.47/1.26
%------------------------------------------------------------------------------