%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KRS086+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.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:07 PM UTC 2026
% Result : Unsatisfiable 0.42s 6.29s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 115 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 136 ( 58 ~; 52 |; 22 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 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 : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 0 sgn 57 !; 9 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(f17,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ? [X1] :
( cp1(X1)
& ? [X2] :
( ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) )
& rinvF(X1,X2) )
& rf(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f18,axiom,
! [X0] :
( cowlThing(X0)
=> ! [X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f19,axiom,
! [X0,X1] :
( rinvF(X0,X1)
<=> rf(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_42328),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f51,plain,
! [X0] :
( ~ cowlThing(X0)
| ! [X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f52,plain,
! [X0] :
( ~ cowlThing(X0)
| ! [X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ) ),
inference(flattening,[],[f51]) ).
fof(f56,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ? [X1] :
( cp1(X1)
& ? [X2] :
( ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) )
& rinvF(X1,X2) )
& rf(X0,X1) ) )
& ( ! [X1] :
( ~ cp1(X1)
| ! [X2] :
( ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) )
| ~ rinvF(X1,X2) )
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f57,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ? [X4] :
( cp1(X4)
& ? [X5] :
( ? [X6] :
( ~ cp1(X6)
& rf(X5,X6) )
& rinvF(X4,X5) )
& rf(X0,X4) ) )
& ( ! [X1] :
( ~ cp1(X1)
| ! [X2] :
( ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) )
| ~ rinvF(X1,X2) )
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(rectify,[],[f56]) ).
fof(f58,plain,
! [X0] :
( ( ~ cUnsatisfiable(X0)
| ( cp1(sK0(X0))
& ~ cp1(sK2(X0))
& rf(sK1(X0),sK2(X0))
& rinvF(sK0(X0),sK1(X0))
& rf(X0,sK0(X0)) ) )
& ( ! [X1] :
( ~ cp1(X1)
| ! [X2] :
( ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) )
| ~ rinvF(X1,X2) )
| ~ rf(X0,X1) )
| cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X4,sK0(X0)),skolemize(X5,sK1(X0)),skolemize(X6,sK2(X0))],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( ( ~ rinvF(X0,X1)
| rf(X1,X0) )
& ( ~ rf(X1,X0)
| rinvF(X0,X1) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f76,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f15]) ).
fof(f79,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(sK0(X0)) ),
inference(cnf_transformation,[],[f58]) ).
fof(f80,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp1(sK2(X0)) ),
inference(cnf_transformation,[],[f58]) ).
fof(f81,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(sK1(X0),sK2(X0)) ),
inference(cnf_transformation,[],[f58]) ).
fof(f82,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rinvF(sK0(X0),sK1(X0)) ),
inference(cnf_transformation,[],[f58]) ).
fof(f85,plain,
! [X2,X0,X1] :
( ~ cowlThing(X0)
| ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f86,plain,
! [X0,X1] :
( ~ rinvF(X0,X1)
| rf(X1,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f91,plain,
cUnsatisfiable(i2003_11_14_17_19_42328),
inference(cnf_transformation,[],[f22]) ).
tcf(c_49,plain,
! [X0: $i] : cowlThing(X0),
inference(cnf_transformation,[],[f76]) ).
tcf(c_55,plain,
! [X0: $i] :
( rinvF(sK0(X0),sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_56,plain,
! [X0: $i] :
( rf(sK1(X0),sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_57,plain,
! [X0: $i] :
( ~ cUnsatisfiable(X0)
| ~ cp1(sK2(X0)) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_58,plain,
! [X0: $i] :
( cp1(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f79]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ cowlThing(X0)
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( rf(X1,X0)
| ~ rinvF(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_65,plain,
cUnsatisfiable(i2003_11_14_17_19_42328),
inference(cnf_transformation,[],[f91]) ).
tcf(c_69,plain,
( cp1(sK0(i2003_11_14_17_19_42328))
| ~ cUnsatisfiable(i2003_11_14_17_19_42328) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf(X0,X1)
| ~ rf(X0,X2) ),
inference(global_subsumption_just,[status(thm)],[c_59,c_49,c_59]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(renaming,[status(thm)],[c_80]) ).
tcf(c_1056,plain,
! [X0: $i] :
( rf(sK1(X0),sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_55,c_61]) ).
tcf(c_1106,plain,
! [X0: $i,X1: $i] :
( ( sK2(X0) = X1 )
| ~ cUnsatisfiable(X0)
| ~ rf(sK1(X0),X1) ),
inference(superposition,[status(thm)],[c_56,c_81]) ).
tcf(c_1145,plain,
! [X0: $i] :
( ( sK0(X0) = sK2(X0) )
| ~ cUnsatisfiable(X0) ),
inference(superposition,[status(thm)],[c_1056,c_1106]) ).
tcf(c_1153,plain,
sK0(i2003_11_14_17_19_42328) = sK2(i2003_11_14_17_19_42328),
inference(superposition,[status(thm)],[c_65,c_1145]) ).
tcf(c_1156,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_42328)
| ~ cp1(sK0(i2003_11_14_17_19_42328)) ),
inference(superposition,[status(thm)],[c_1153,c_57]) ).
tcf(c_1157,plain,
~ cp1(sK0(i2003_11_14_17_19_42328)),
inference(forward_subsumption_resolution,[status(thm)],[c_1156,c_65]) ).
tcf(c_1160,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1157,c_69,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS086+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n010.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Wed Sep 23 19:21:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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.14/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 0.42/6.29 % SZS status Started for theBenchmark.p
% 0.42/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/6.29
% 0.42/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.42/6.29
% 0.42/6.29 % ------ iProver source info
% 0.42/6.29
% 0.42/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.42/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.42/6.29 % git: non_committed_changes: false
% 0.42/6.29
% 0.42/6.29 % ------ Parsing...
% 0.42/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.42/6.29
% 0.42/6.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 8 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.42/6.29
% 0.42/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.42/6.29
% 0.42/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.42/6.29 % ------ Proving...
% 0.42/6.29 % ------ Problem Properties
% 0.42/6.29
% 0.42/6.29 %
% 0.42/6.29 % clauses 10
% 0.42/6.29 % conjectures 0
% 0.42/6.29 % EPR 5
% 0.42/6.29 % Horn 9
% 0.42/6.29 % unary 1
% 0.42/6.29 % binary 7
% 0.42/6.29 % lits 24
% 0.42/6.29 % lits eq 1
% 0.42/6.29 % fd_pure 0
% 0.42/6.29 % fd_pseudo 0
% 0.42/6.29 % fd_cond 0
% 0.42/6.29 % fd_pseudo_cond 1
% 0.42/6.29 % AC symbols 0
% 0.42/6.29
% 0.42/6.29 % ------ Schedule dynamic 5 is on
% 0.42/6.29
% 0.42/6.29 % ------ no conjectures: strip conj schedule
% 0.42/6.29
% 0.42/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.42/6.29
% 0.42/6.29
% 0.42/6.29 % ------
% 0.42/6.29 % Current options:
% 0.42/6.29 % ------
% 0.42/6.29
% 0.42/6.29
% 0.42/6.29 %
% 0.42/6.29
% 0.42/6.29 % ------ Proving...
% 0.42/6.29 %
% 0.42/6.29
% 0.42/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/6.29
% 0.42/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/6.29
% 0.42/6.29
%------------------------------------------------------------------------------