%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN726+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:29 PM UTC 2026
% Result : Theorem 1.76s 1.30s
% Output : CNFRefutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 46 ( 5 unt; 0 def)
% Number of atoms : 173 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 202 ( 75 ~; 80 |; 35 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 131 ( 0 sgn 119 !; 12 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0,X1] : q(X0,X1)
| ( ( ! [X0,X1] :
( q(X0,X1)
| p(X0,X1) )
& ! [X0,X1] :
( q(X0,X1)
=> q(X1,X0) )
& ! [X0,X1,X2] :
( ( q(X1,X2)
& q(X0,X1) )
=> q(X0,X2) )
& ! [X0,X1,X2] :
( ( p(X1,X2)
& p(X0,X1) )
=> p(X0,X2) ) )
=> ! [X0,X1] : p(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm400) ).
fof(f2,negated_conjecture,
~ ( ! [X0,X1] : q(X0,X1)
| ( ( ! [X0,X1] :
( q(X0,X1)
| p(X0,X1) )
& ! [X0,X1] :
( q(X0,X1)
=> q(X1,X0) )
& ! [X0,X1,X2] :
( ( q(X1,X2)
& q(X0,X1) )
=> q(X0,X2) )
& ! [X0,X1,X2] :
( ( p(X1,X2)
& p(X0,X1) )
=> p(X0,X2) ) )
=> ! [X0,X1] : p(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X12,X13] : q(X12,X13)
| ( ( ! [X8,X9] :
( q(X8,X9)
| p(X8,X9) )
& ! [X6,X7] :
( q(X6,X7)
=> q(X7,X6) )
& ! [X3,X4,X5] :
( ( q(X4,X5)
& q(X3,X4) )
=> q(X3,X5) )
& ! [X0,X1,X2] :
( ( p(X1,X2)
& p(X0,X1) )
=> p(X0,X2) ) )
=> ! [X10,X11] : p(X10,X11) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X12,X13] : ~ q(X12,X13)
& ! [X8,X9] :
( q(X8,X9)
| p(X8,X9) )
& ! [X6,X7] :
( ~ q(X6,X7)
| q(X7,X6) )
& ! [X3,X4,X5] :
( ~ q(X4,X5)
| ~ q(X3,X4)
| q(X3,X5) )
& ! [X0,X1,X2] :
( ~ p(X1,X2)
| ~ p(X0,X1)
| p(X0,X2) )
& ? [X10,X11] : ~ p(X10,X11) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X12,X13] : ~ q(X12,X13)
& ! [X8,X9] :
( q(X8,X9)
| p(X8,X9) )
& ! [X6,X7] :
( ~ q(X6,X7)
| q(X7,X6) )
& ! [X3,X4,X5] :
( ~ q(X4,X5)
| ~ q(X3,X4)
| q(X3,X5) )
& ! [X0,X1,X2] :
( ~ p(X1,X2)
| ~ p(X0,X1)
| p(X0,X2) )
& ? [X10,X11] : ~ p(X10,X11) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X12,X13] : ~ q(X12,X13)
& ! [X10,X11] :
( q(X10,X11)
| p(X10,X11) )
& ! [X8,X9] :
( ~ q(X8,X9)
| q(X9,X8) )
& ! [X5,X6,X7] :
( ~ q(X6,X7)
| ~ q(X5,X6)
| q(X5,X7) )
& ! [X2,X3,X4] :
( ~ p(X3,X4)
| ~ p(X2,X3)
| p(X2,X4) )
& ? [X0,X1] : ~ p(X0,X1) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ~ q(sK2,sK3)
& ! [X10,X11] :
( q(X10,X11)
| p(X10,X11) )
& ! [X8,X9] :
( ~ q(X8,X9)
| q(X9,X8) )
& ! [X5,X6,X7] :
( ~ q(X6,X7)
| ~ q(X5,X6)
| q(X5,X7) )
& ! [X2,X3,X4] :
( ~ p(X3,X4)
| ~ p(X2,X3)
| p(X2,X4) )
& ~ p(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X12,sK2),skolemize(X13,sK3)],[f6]) ).
fof(f8,plain,
~ q(sK2,sK3),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X10,X11] :
( q(X10,X11)
| p(X10,X11) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X8,X9] :
( ~ q(X8,X9)
| q(X9,X8) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X6,X7,X5] :
( ~ q(X6,X7)
| ~ q(X5,X6)
| q(X5,X7) ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X2,X3,X4] :
( ~ p(X3,X4)
| ~ p(X2,X3)
| p(X2,X4) ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
~ p(sK0,sK1),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
~ p(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( p(X0,X2)
| ~ p(X1,X2)
| ~ p(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( q(X0,X2)
| ~ q(X1,X2)
| ~ q(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i] :
( q(X1,X0)
| ~ q(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_53,negated_conjecture,
! [X0: $i,X1: $i] :
( q(X0,X1)
| p(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_54,negated_conjecture,
~ q(sK2,sK3),
inference(cnf_transformation,[],[f8]) ).
tcf(c_81,negated_conjecture,
! [X0: $i,X1: $i] :
( q(X0,X1)
| p(X0,X1) ),
inference(demodulation,[status(thm)],[c_53]) ).
tcf(c_82,negated_conjecture,
! [X0: $i,X1: $i] :
( q(X1,X0)
| ~ q(X0,X1) ),
inference(demodulation,[status(thm)],[c_52]) ).
tcf(c_83,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( q(X0,X2)
| ~ q(X1,X2)
| ~ q(X0,X1) ),
inference(demodulation,[status(thm)],[c_51]) ).
tcf(c_84,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( p(X0,X2)
| ~ p(X1,X2)
| ~ p(X0,X1) ),
inference(demodulation,[status(thm)],[c_50]) ).
tcf(c_86,plain,
( q(sK0,sK1)
| p(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_87,plain,
! [X0: $i] :
( p(sK0,sK1)
| ~ p(sK0,X0)
| ~ p(X0,sK1) ),
inference(instantiation,[status(thm)],[c_84]) ).
tcf(c_88,plain,
( q(sK1,sK0)
| ~ q(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_82]) ).
tcf(c_90,plain,
! [X0: $i] :
( q(X0,sK1)
| p(X0,sK1) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_93,plain,
! [X0: $i] :
( q(X0,sK0)
| ~ q(sK1,sK0)
| ~ q(X0,sK1) ),
inference(instantiation,[status(thm)],[c_83]) ).
tcf(c_95,plain,
( q(sK2,sK3)
| ~ q(sK3,sK2) ),
inference(instantiation,[status(thm)],[c_82]) ).
tcf(c_96,plain,
! [X0: $i] :
( q(sK2,sK3)
| ~ q(sK2,X0)
| ~ q(X0,sK3) ),
inference(instantiation,[status(thm)],[c_83]) ).
tcf(c_97,plain,
( q(sK2,sK3)
| ~ q(sK2,sK0)
| ~ q(sK0,sK3) ),
inference(instantiation,[status(thm)],[c_96]) ).
tcf(c_100,plain,
! [X0: $i] :
( q(sK3,sK2)
| ~ q(sK3,X0)
| ~ q(X0,sK2) ),
inference(instantiation,[status(thm)],[c_83]) ).
tcf(c_101,plain,
( q(sK3,sK2)
| ~ q(sK3,sK0)
| ~ q(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_104,plain,
! [X0: $i] :
( q(X0,sK3)
| ~ q(sK3,X0) ),
inference(instantiation,[status(thm)],[c_82]) ).
tcf(c_105,plain,
( q(sK0,sK3)
| ~ q(sK3,sK0) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_110,plain,
! [X0: $i] :
( q(sK3,X0)
| ~ q(X0,sK3) ),
inference(instantiation,[status(thm)],[c_82]) ).
tcf(c_111,plain,
( q(sK3,sK0)
| ~ q(sK0,sK3) ),
inference(instantiation,[status(thm)],[c_110]) ).
tcf(c_113,plain,
( q(sK3,sK0)
| ~ q(sK3,sK1)
| ~ q(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_93]) ).
tcf(c_115,plain,
( q(sK3,sK1)
| p(sK3,sK1) ),
inference(instantiation,[status(thm)],[c_90]) ).
tcf(c_123,plain,
( q(sK2,sK0)
| ~ q(sK2,sK1)
| ~ q(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_93]) ).
tcf(c_125,plain,
( q(sK2,sK1)
| p(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_90]) ).
tcf(c_185,plain,
( p(sK0,sK1)
| ~ p(sK3,sK1)
| ~ p(sK0,sK3) ),
inference(instantiation,[status(thm)],[c_87]) ).
tcf(c_219,plain,
( q(sK0,sK3)
| p(sK0,sK3) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_286,plain,
( p(sK0,sK1)
| ~ p(sK2,sK1)
| ~ p(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_87]) ).
tcf(c_310,plain,
( q(sK0,sK2)
| p(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_316,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_310,c_286,c_219,c_185,c_125,c_123,c_115,c_113,c_111,c_105,c_101,c_97,c_95,c_88,c_86,c_49,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN726+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Fri Sep 25 02:09:38 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 1.76/1.30 % SZS status Started for theBenchmark.p
% 1.76/1.30 % SZS status Theorem for theBenchmark.p
% 1.76/1.30
% 1.76/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.76/1.30
% 1.76/1.30 % ------ iProver source info
% 1.76/1.30
% 1.76/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.76/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.76/1.30 % git: non_committed_changes: false
% 1.76/1.30
% 1.76/1.30 % ------ Parsing...
% 1.76/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.76/1.30 %
% 1.76/1.30
% 1.76/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.76/1.30
% 1.76/1.30 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.76/1.30 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.76/1.30 % ------ Proving...
% 1.76/1.30 % ------ Problem Properties
% 1.76/1.30
% 1.76/1.30 %
% 1.76/1.30 % clauses 6
% 1.76/1.30 % conjectures 6
% 1.76/1.30 % EPR 6
% 1.76/1.30 % Horn 5
% 1.76/1.30 % unary 2
% 1.76/1.30 % binary 2
% 1.76/1.30 % lits 12
% 1.76/1.30 % lits eq 0
% 1.76/1.30 % fd_pure 0
% 1.76/1.30 % fd_pseudo 0
% 1.76/1.30 % fd_cond 0
% 1.76/1.30 % fd_pseudo_cond 0
% 1.76/1.30 % AC symbols 0
% 1.76/1.30
% 1.76/1.30 % ------ Schedule EPR non Horn non eq is on
% 1.76/1.30
% 1.76/1.30 % ------ no equalities: superposition off
% 1.76/1.30
% 1.76/1.30 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.76/1.30
% 1.76/1.30
% 1.76/1.30 % ------
% 1.76/1.30 % Current options:
% 1.76/1.30 % ------
% 1.76/1.30
% 1.76/1.30
% 1.76/1.30 %
% 1.76/1.30
% 1.76/1.30 % ------ Proving...
% 1.76/1.30 %
% 1.76/1.30
% 1.76/1.30 % SZS status Theorem for theBenchmark.p
% 1.76/1.30
% 1.76/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.76/1.30
% 1.76/1.30
%------------------------------------------------------------------------------