%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS012-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n001.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 01:54:00 PM UTC 2026
% Result : Unsatisfiable 0.42s 1.28s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 45 ( 22 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c(exists),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f2,negated_conjecture,
~ f(exists),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f3,axiom,
! [X0,X1] :
( ~ d(X0)
| ~ r(X1,X0)
| ~ c(X1)
| e(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f4,axiom,
! [X0,X1] :
( ~ r(X1,X0)
| ~ c(X1)
| d(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f12,axiom,
! [X0] :
( ~ e(u1r1(X0))
| f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).
fof(f13,axiom,
! [X0] :
( r(X0,u1r1(X0))
| f(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).
tcf(c_62,negated_conjecture,
c(exists),
inference(cnf_transformation,[],[f1]) ).
tcf(c_63,negated_conjecture,
~ f(exists),
inference(cnf_transformation,[],[f2]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( e(X1)
| ~ d(X1)
| ~ c(X0)
| ~ r(X0,X1) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( d(X1)
| ~ c(X0)
| ~ r(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_73,plain,
! [X0: $i] :
( f(X0)
| ~ e(u1r1(X0)) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_74,plain,
! [X0: $i] :
( f(X0)
| r(X0,u1r1(X0)) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_75,plain,
( f(exists)
| r(exists,u1r1(exists)) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( e(X1)
| ~ r(X0,X1)
| ~ c(X0) ),
inference(global_subsumption_just,[status(thm)],[c_64,c_65,c_64]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] :
( e(X1)
| ~ c(X0)
| ~ r(X0,X1) ),
inference(renaming,[status(thm)],[c_79]) ).
tcf(c_272,plain,
! [X0: $i,X1: $i] :
( f(X1)
| ~ c(X0)
| ~ r(X0,u1r1(X1)) ),
inference(resolution,[status(thm)],[c_80,c_73]) ).
tcf(c_273,plain,
( f(exists)
| ~ c(exists)
| ~ r(exists,u1r1(exists)) ),
inference(instantiation,[status(thm)],[c_272]) ).
tcf(c_274,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_273,c_75,c_63,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS012-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 19:20:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 0.42/1.28 % SZS status Started for theBenchmark.p
% 0.42/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/1.28
% 0.42/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.42/1.28
% 0.42/1.28 % ------ iProver source info
% 0.42/1.28
% 0.42/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.42/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.42/1.28 % git: non_committed_changes: false
% 0.42/1.28
% 0.42/1.28 % ------ Parsing...% successful
% 0.42/1.28
% 0.42/1.28
% 0.42/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.42/1.28
% 0.42/1.28 % ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s %
% 0.42/1.28
% 0.42/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/1.28
% 0.42/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.29
% 0.42/1.29
%------------------------------------------------------------------------------