%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS015-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n020.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:01 PM UTC 2026
% Result : Unsatisfiable 1.95s 1.17s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 45 ( 3 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 138 ( 72 ~; 66 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f2,axiom,
! [X0] :
( ~ c(X0)
| t2least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f4,axiom,
! [X0] :
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ t2least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f5,axiom,
! [X0] :
( ~ t2least(X0)
| t(X0,u1r1(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
fof(f6,axiom,
! [X0] :
( ~ t2least(X0)
| t(X0,u1r2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f8,axiom,
! [X0] :
( ~ d(X0)
| t1most(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
fof(f10,axiom,
! [X2,X0,X1] :
( ~ t(X2,X1)
| ~ t(X2,X0)
| ~ t1most(X2)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
fof(f14,axiom,
! [X0] :
( ~ e(X0)
| r(X0,u4r4(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
fof(f15,axiom,
! [X0,X1] :
( ~ r(X0,X1)
| ~ e(X0)
| s(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
fof(f17,axiom,
! [X0,X1] :
( ~ s(X1,X0)
| ~ e(X1)
| d(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).
fof(f18,axiom,
! [X0,X1] :
( ~ r(X1,X0)
| ~ e(X1)
| c(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
tcf(c_75,negated_conjecture,
e(exist),
inference(cnf_transformation,[],[f1]) ).
tcf(c_76,plain,
! [X0: $i] :
( t2least(X0)
| ~ c(X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_78,plain,
! [X0: $i] :
( ~ t2least(X0)
| ~ equalish(u1r2(X0),u1r1(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_79,plain,
! [X0: $i] :
( t(X0,u1r1(X0))
| ~ t2least(X0) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_80,plain,
! [X0: $i] :
( t(X0,u1r2(X0))
| ~ t2least(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_82,plain,
! [X0: $i] :
( t1most(X0)
| ~ d(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X2,X1)
| ~ t1most(X0)
| ~ t(X0,X2)
| ~ t(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_88,plain,
! [X0: $i] :
( r(X0,u4r4(X0))
| ~ e(X0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i] :
( s(X0,X1)
| ~ e(X0)
| ~ r(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i] :
( d(X1)
| ~ e(X0)
| ~ s(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i] :
( c(X1)
| ~ e(X0)
| ~ r(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_107,plain,
( r(exist,u4r4(exist))
| ~ e(exist) ),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_124,plain,
! [X0: $i] :
( t1most(X0)
| ~ d(X0) ),
inference(prop_impl_just,[status(thm)],[c_82]) ).
tcf(c_126,plain,
! [X0: $i] :
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ c(X0) ),
inference(prop_impl_just,[status(thm)],[c_76,c_78]) ).
tcf(c_127,plain,
! [X0: $i] :
( ~ c(X0)
| ~ equalish(u1r2(X0),u1r1(X0)) ),
inference(renaming,[status(thm)],[c_126]) ).
tcf(c_128,plain,
! [X0: $i] :
( t(X0,u1r1(X0))
| ~ c(X0) ),
inference(prop_impl_just,[status(thm)],[c_76,c_79]) ).
tcf(c_130,plain,
! [X0: $i] :
( t(X0,u1r2(X0))
| ~ c(X0) ),
inference(prop_impl_just,[status(thm)],[c_76,c_80]) ).
tcf(c_195,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X2,X1)
| ~ d(X0)
| ~ t(X0,X2)
| ~ t(X0,X1) ),
inference(bin_hyper_res,[status(thm)],[c_84,c_124]) ).
tcf(c_4697,plain,
! [X0: $i] :
( c(u4r4(X0))
| ~ e(X0)
| ~ r(X0,u4r4(X0)) ),
inference(instantiation,[status(thm)],[c_92]) ).
tcf(c_4698,plain,
( c(u4r4(exist))
| ~ e(exist)
| ~ r(exist,u4r4(exist)) ),
inference(instantiation,[status(thm)],[c_4697]) ).
tcf(c_4699,plain,
! [X0: $i] :
( s(X0,u4r4(X0))
| ~ e(X0)
| ~ r(X0,u4r4(X0)) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_4700,plain,
( s(exist,u4r4(exist))
| ~ e(exist)
| ~ r(exist,u4r4(exist)) ),
inference(instantiation,[status(thm)],[c_4699]) ).
tcf(c_4701,plain,
! [X0: $i] :
( t(u4r4(X0),u1r2(u4r4(X0)))
| ~ c(u4r4(X0)) ),
inference(instantiation,[status(thm)],[c_130]) ).
tcf(c_4702,plain,
! [X0: $i] :
( t(u4r4(X0),u1r1(u4r4(X0)))
| ~ c(u4r4(X0)) ),
inference(instantiation,[status(thm)],[c_128]) ).
tcf(c_4703,plain,
! [X0: $i] :
( ~ c(u4r4(X0))
| ~ equalish(u1r2(u4r4(X0)),u1r1(u4r4(X0))) ),
inference(instantiation,[status(thm)],[c_127]) ).
tcf(c_4704,plain,
( ~ c(u4r4(exist))
| ~ equalish(u1r2(u4r4(exist)),u1r1(u4r4(exist))) ),
inference(instantiation,[status(thm)],[c_4703]) ).
tcf(c_4705,plain,
( t(u4r4(exist),u1r1(u4r4(exist)))
| ~ c(u4r4(exist)) ),
inference(instantiation,[status(thm)],[c_4702]) ).
tcf(c_4706,plain,
( t(u4r4(exist),u1r2(u4r4(exist)))
| ~ c(u4r4(exist)) ),
inference(instantiation,[status(thm)],[c_4701]) ).
tcf(c_4712,plain,
! [X0: $i,X1: $i] :
( equalish(X1,u1r1(u4r4(X0)))
| ~ d(u4r4(X0))
| ~ t(u4r4(X0),X1)
| ~ t(u4r4(X0),u1r1(u4r4(X0))) ),
inference(instantiation,[status(thm)],[c_195]) ).
tcf(c_4722,plain,
! [X0: $i,X1: $i] :
( d(u4r4(X1))
| ~ e(X0)
| ~ s(X0,u4r4(X1)) ),
inference(instantiation,[status(thm)],[c_91]) ).
tcf(c_4723,plain,
( d(u4r4(exist))
| ~ e(exist)
| ~ s(exist,u4r4(exist)) ),
inference(instantiation,[status(thm)],[c_4722]) ).
tcf(c_4738,plain,
! [X0: $i] :
( equalish(u1r2(u4r4(X0)),u1r1(u4r4(X0)))
| ~ d(u4r4(X0))
| ~ t(u4r4(X0),u1r1(u4r4(X0)))
| ~ t(u4r4(X0),u1r2(u4r4(X0))) ),
inference(instantiation,[status(thm)],[c_4712]) ).
tcf(c_4739,plain,
( equalish(u1r2(u4r4(exist)),u1r1(u4r4(exist)))
| ~ d(u4r4(exist))
| ~ t(u4r4(exist),u1r1(u4r4(exist)))
| ~ t(u4r4(exist),u1r2(u4r4(exist))) ),
inference(instantiation,[status(thm)],[c_4738]) ).
tcf(c_4740,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4739,c_4723,c_4706,c_4705,c_4704,c_4700,c_4698,c_107,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS015-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n020.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.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 19:15:49 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.95/1.17 % SZS status Started for theBenchmark.p
% 1.95/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.95/1.17
% 1.95/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.95/1.17
% 1.95/1.17 % ------ iProver source info
% 1.95/1.17
% 1.95/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.95/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.95/1.17 % git: non_committed_changes: false
% 1.95/1.17
% 1.95/1.17 % ------ Parsing...% successful
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.95/1.17
% 1.95/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.95/1.17
% 1.95/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.95/1.17 % ------ Proving...
% 1.95/1.17 % ------ Problem Properties
% 1.95/1.17
% 1.95/1.17 %
% 1.95/1.17 % clauses 22
% 1.95/1.17 % conjectures 1
% 1.95/1.17 % EPR 7
% 1.95/1.17 % Horn 12
% 1.95/1.17 % unary 1
% 1.95/1.17 % binary 7
% 1.95/1.17 % lits 83
% 1.95/1.17 % lits eq 0
% 1.95/1.17 % fd_pure 0
% 1.95/1.17 % fd_pseudo 0
% 1.95/1.17 % fd_cond 0
% 1.95/1.17 % fd_pseudo_cond 0
% 1.95/1.17 % AC symbols 0
% 1.95/1.17
% 1.95/1.17 % ------ Schedule dynamic 5 is on
% 1.95/1.17
% 1.95/1.17 % ------ no equalities: superposition off
% 1.95/1.17
% 1.95/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17 % ------
% 1.95/1.17 % Current options:
% 1.95/1.17 % ------
% 1.95/1.17
% 1.95/1.17
% 1.95/1.17 %
% 1.95/1.17
% 1.95/1.17 % ------ Proving...
% 1.95/1.17 %
% 1.95/1.17
% 1.95/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 1.95/1.17
% 1.95/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.95/1.17
% 1.95/1.17
%------------------------------------------------------------------------------