%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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 02:07:49 PM UTC 2026
% Result : Theorem 0.39s 1.29s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 274 ( 130 ~; 126 |; 18 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 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 : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 97 ( 0 sgn 78 !; 19 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p15(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p14(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p15(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p14(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
~ ~ ? [X0] :
~ ( ! [X8] :
( p11(X8)
| ~ r1(X0,X8) )
| ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ! [X6] :
( p13(X6)
| ~ r1(X0,X6) )
| ! [X5] :
( p15(X5)
| ~ r1(X0,X5) )
| ~ ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
| ~ ! [X3] :
( p14(X3)
| ~ r1(X0,X3) )
| ~ ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
? [X0] :
~ ( ! [X8] :
( p11(X8)
| ~ r1(X0,X8) )
| ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ! [X6] :
( p13(X6)
| ~ r1(X0,X6) )
| ! [X5] :
( p15(X5)
| ~ r1(X0,X5) )
| ~ ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
| ~ ! [X3] :
( p14(X3)
| ~ r1(X0,X3) )
| ~ ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X8] : ~ r1(X0,X8)
| ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ! [X6] :
( p13(X6)
| ~ r1(X0,X6) )
| ! [X5] :
( p15(X5)
| ~ r1(X0,X5) )
| ~ ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
| ~ ! [X3] :
( p14(X3)
| ~ r1(X0,X3) )
| ~ ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f7,plain,
? [X0] :
~ ( ! [X8] : ~ r1(X0,X8)
| ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ! [X6] : ~ r1(X0,X6)
| ! [X5] :
( p15(X5)
| ~ r1(X0,X5) )
| ~ ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
| ~ ! [X3] :
( p14(X3)
| ~ r1(X0,X3) )
| ~ ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X8] : ~ r1(X0,X8)
| ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ! [X6] : ~ r1(X0,X6)
| ! [X5] : ~ r1(X0,X5)
| ~ ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
| ~ ! [X3] :
( p14(X3)
| ~ r1(X0,X3) )
| ~ ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X8] : ~ r1(X0,X8)
| ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ! [X6] : ~ r1(X0,X6)
| ! [X5] : ~ r1(X0,X5)
| ~ ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
| ~ ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f10,plain,
? [X0] :
~ ( ! [X8] : ~ r1(X0,X8)
| ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ! [X6] : ~ r1(X0,X6)
| ! [X5] : ~ r1(X0,X5)
| ~ ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
| ~ ! [X2] :
( p12(X2)
| ~ r1(X0,X2) ) ),
inference(pure_predicate_removal,[],[f9]) ).
fof(f11,plain,
? [X0] :
( ? [X8] : r1(X0,X8)
& ? [X7] :
( ~ p12(X7)
& r1(X0,X7) )
& ? [X6] : r1(X0,X6)
& ? [X5] : r1(X0,X5)
& ! [X4] :
( p12(X4)
| ~ r1(X0,X4) )
& ! [X2] :
( p12(X2)
| ~ r1(X0,X2) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f12,plain,
? [X0] :
( ? [X6] : r1(X0,X6)
& ? [X5] :
( ~ p12(X5)
& r1(X0,X5) )
& ? [X4] : r1(X0,X4)
& ? [X3] : r1(X0,X3)
& ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
& ! [X1] :
( p12(X1)
| ~ r1(X0,X1) ) ),
inference(rectify,[],[f11]) ).
fof(f13,plain,
( r1(sK0,sK4)
& ~ p12(sK3)
& r1(sK0,sK3)
& r1(sK0,sK2)
& r1(sK0,sK1)
& ! [X2] :
( p12(X2)
| ~ r1(sK0,X2) )
& ! [X1] :
( p12(X1)
| ~ r1(sK0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X3,sK1),skolemize(X4,sK2),skolemize(X5,sK3),skolemize(X6,sK4)],[f12]) ).
fof(f16,plain,
~ p12(sK3),
inference(cnf_transformation,[],[f13]) ).
fof(f17,plain,
r1(sK0,sK3),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X2] :
( p12(X2)
| ~ r1(sK0,X2) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( p12(X0)
| ~ r1(sK0,X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_54,negated_conjecture,
r1(sK0,sK3),
inference(cnf_transformation,[],[f17]) ).
tcf(c_55,negated_conjecture,
~ p12(sK3),
inference(cnf_transformation,[],[f16]) ).
tcf(c_61,negated_conjecture,
r1(sK0,sK3),
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_64,negated_conjecture,
! [X0: $i] :
( p12(X0)
| ~ r1(sK0,X0) ),
inference(demodulation,[status(thm)],[c_51]) ).
tcf(c_67,plain,
p12(sK3),
inference(resolution,[status(thm)],[c_64,c_61]) ).
tcf(c_68,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_67,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.39 % Computer : n016.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Thu Sep 24 00:11:57 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...
% 0.39/1.29 % SZS status Started for theBenchmark.p
% 0.39/1.29 % SZS status Theorem for theBenchmark.p
% 0.39/1.29
% 0.39/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.39/1.29
% 0.39/1.29 % ------ iProver source info
% 0.39/1.29
% 0.39/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.39/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.39/1.29 % git: non_committed_changes: false
% 0.39/1.29
% 0.39/1.29 % ------ Parsing...
% 0.39/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 0.39/1.29 %
% 0.39/1.29
% 0.39/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e sf_s rm: 0 0s sf_e %
% 0.39/1.29
% 0.39/1.29 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 0.39/1.29 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.39/1.29 % ------ Proving...
% 0.39/1.29 % ------ Problem Properties
% 0.39/1.29
% 0.39/1.29 %
% 0.39/1.29 % clauses 7
% 0.39/1.29 % conjectures 6
% 0.39/1.29 % EPR 7
% 0.39/1.29 % Horn 7
% 0.39/1.29 % unary 6
% 0.39/1.29 % binary 1
% 0.39/1.29 % lits 8
% 0.39/1.29 % lits eq 0
% 0.39/1.29 % fd_pure 0
% 0.39/1.29 % fd_pseudo 0
% 0.39/1.29 % fd_cond 0
% 0.39/1.29 % fd_pseudo_cond 0
% 0.39/1.29 % AC symbols 0
% 0.39/1.29
% 0.39/1.29 % ------ Schedule EPR Horn non eq is on
% 0.39/1.29
% 0.39/1.29 % ------ no equalities: superposition off
% 0.39/1.29
% 0.39/1.29 % ------ Option_epr_horn Time Limit: Unbounded
% 0.39/1.29
% 0.39/1.29
% 0.39/1.29 % ------
% 0.39/1.29 % Current options:
% 0.39/1.29 % ------
% 0.39/1.29
% 0.39/1.29
% 0.39/1.29 %
% 0.39/1.29
% 0.39/1.29 % ------ Proving...
% 0.39/1.29 %
% 0.39/1.29
% 0.39/1.29 % SZS status Theorem for theBenchmark.p
% 0.39/1.29
% 0.39/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.39/1.29
% 0.39/1.29
%------------------------------------------------------------------------------