%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:51 PM UTC 2026
% Result : Theorem 1.11s 1.27s
% Output : CNFRefutation 1.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 66 ( 36 ~; 18 |; 12 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 11 !; 5 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f2,conjecture,
~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(X0,X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( p101(sK0)
& p201(sK0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(sK0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f6]) ).
fof(f8,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f9,plain,
p101(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
p201(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,plain,
! [X0: $i] : r1(X0,X0),
inference(cnf_transformation,[],[f8]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( ~ p101(X0)
| ~ p201(X0)
| ~ r1(sK0,X0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,negated_conjecture,
p201(sK0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_52,negated_conjecture,
p101(sK0),
inference(cnf_transformation,[],[f9]) ).
tcf(c_53,plain,
r1(sK0,sK0),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_54,plain,
( ~ p101(sK0)
| ~ p201(sK0)
| ~ r1(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_55,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_54,c_53,c_51,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n016.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.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Thu Sep 24 00:13:11 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.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.11/1.27 % SZS status Started for theBenchmark.p
% 1.11/1.27 % SZS status Theorem for theBenchmark.p
% 1.11/1.27
% 1.11/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.11/1.27
% 1.11/1.27 % ------ iProver source info
% 1.11/1.27
% 1.11/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.11/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.11/1.27 % git: non_committed_changes: false
% 1.11/1.27
% 1.11/1.27 % ------ Parsing...
% 1.11/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 1.11/1.27 %
% 1.11/1.27
% 1.11/1.27 % ------ Preprocessing...%
% 1.11/1.27
% 1.11/1.27 % SZS status Theorem for theBenchmark.p
% 1.11/1.27
% 1.11/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.11/1.27
% 1.11/1.27
%------------------------------------------------------------------------------