%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL678+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 : n006.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:08:05 PM UTC 2026
% Result : Theorem 1.32s 11.32s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 120 ( 67 ~; 47 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 2 ( 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 : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 45 ( 0 sgn 37 !; 8 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0) )
| $false
| ~ r1(X0,X1) )
| $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ~ r1(X1,X2) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
~ ~ ? [X0] :
~ ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(true_and_false_elimination,[],[f5]) ).
fof(f7,plain,
? [X0] :
! [X1] :
( ~ ! [X2] :
( ~ ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(flattening,[],[f6]) ).
fof(f10,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
& ? [X3] :
( ~ p1(X3)
& r1(X2,X3) )
& r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f11,plain,
! [X1] :
( ( ! [X4] :
( p1(X4)
| ~ r1(sK1(X1),X4) )
& ~ p1(sK2(X1))
& r1(sK1(X1),sK2(X1))
& r1(X1,sK1(X1)) )
| ~ r1(sK0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X2,sK1(X1)),skolemize(X3,sK2(X1))],[f10]) ).
fof(f12,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X1,X4] :
( p1(X4)
| ~ r1(sK1(X1),X4)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f15,plain,
! [X1] :
( ~ p1(sK2(X1))
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f16,plain,
! [X1] :
( r1(sK1(X1),sK2(X1))
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_49,plain,
! [X0: $i] : r1(X0,X0),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( r1(sK1(X0),sK2(X0))
| ~ r1(sK0,X0) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( ~ p1(sK2(X0))
| ~ r1(sK0,X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_54,negated_conjecture,
! [X0: $i,X1: $i] :
( p1(X1)
| ~ r1(sK0,X0)
| ~ r1(sK1(X0),X1) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_55,plain,
r1(sK0,sK0),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_58,plain,
( r1(sK1(sK0),sK2(sK0))
| ~ r1(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( ~ r1(sK0,X1)
| ~ r1(sK0,X0)
| ~ r1(sK1(X0),sK2(X1)) ),
inference(resolution,[status(thm)],[c_53,c_54]) ).
tcf(c_87,plain,
( ~ r1(sK0,sK0)
| ~ r1(sK1(sK0),sK2(sK0)) ),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_88,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_87,c_58,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.39 % Computer : n006.cluster.edu
% 0.14/10.39 % Model : x86_64 x86_64
% 0.14/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.39 % Memory : 8046.5625MB
% 0.14/10.39 % OS : Linux 6.8.0-71-generic
% 0.14/10.40 % CPULimit : 300
% 0.14/10.40 % WCLimit : 300
% 0.14/10.40 % DateTime : Thu Sep 24 00:15:11 UTC 2026
% 0.16/10.40 % CPUTime :
% 0.16/10.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/10.44 Running first-order theorem proving
% 0.16/10.44 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.16/10.45
% 0.16/10.45 % ======== iProver multi-core TPTP/SMT =========
% 0.16/10.45
% 0.16/10.45 % Detected problem language: tptp
% 0.16/10.47 % Proving...
% 1.32/11.32 % SZS status Started for theBenchmark.p
% 1.32/11.32 % SZS status Theorem for theBenchmark.p
% 1.32/11.32
% 1.32/11.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.32/11.32
% 1.32/11.32 % ------ iProver source info
% 1.32/11.32
% 1.32/11.32 % git: date: 2026-07-19 20:42:38 +0200
% 1.32/11.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.32/11.32 % git: non_committed_changes: false
% 1.32/11.32
% 1.32/11.32 % ------ Parsing...
% 1.32/11.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.32/11.32
% 1.32/11.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s %
% 1.32/11.32
% 1.32/11.32 % SZS status Theorem for theBenchmark.p
% 1.32/11.32
% 1.32/11.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.32/11.32
% 1.32/11.32
%------------------------------------------------------------------------------