%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SCT026-1 : TPTP v9.3.1. Released v4.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 02:40:38 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.29s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 35 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 35 ( 17 ~; 18 |; 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 : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f404,axiom,
! [X2,X3,X0,X1,X4] :
( ~ c_in(c_Pair(X1,X0,X3,X2),X4,tc_prod(X3,X2))
| c_in(c_Pair(X0,X1,X2,X3),c_Relation_Oconverse(X4,X3,X2),tc_prod(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_converse__iff_1) ).
fof(f498,axiom,
c_in(v_sko__Arrow__Order__Mirabelle__Xlinear__alt__1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_linear__alt_0) ).
fof(f500,axiom,
! [X0] :
( ~ c_in(X0,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| c_in(c_Relation_Oconverse(X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_converse__in__Lin_1) ).
fof(f566,axiom,
v_a != v_b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_assms_0) ).
fof(f568,axiom,
! [X2,X0,X1] :
( ~ c_in(X2,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| X1 = X0
| c_in(c_Pair(X1,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X2,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X0,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X2,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_notin__Lin__iff_0) ).
fof(f569,plain,
! [X2,X0,X1] :
( ~ c_in(X2,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| X0 = X1
| c_in(c_Pair(X1,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X2,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X0,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X2,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(reorient_equations,[],[f568]) ).
fof(f573,negated_conjecture,
! [X0] :
( ~ c_in(X0,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X0,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
tcf(c_934,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( c_in(c_Pair(X1,X0,X3,X2),c_Relation_Oconverse(X4,X2,X3),tc_prod(X3,X2))
| ~ c_in(c_Pair(X0,X1,X2,X3),X4,tc_prod(X2,X3)) ),
inference(cnf_transformation,[],[f404]) ).
tcf(c_1018,plain,
c_in(v_sko__Arrow__Order__Mirabelle__Xlinear__alt__1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
inference(cnf_transformation,[],[f498]) ).
tcf(c_1020,plain,
! [X0: $i] :
( c_in(c_Relation_Oconverse(X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(X0,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_1075,plain,
v_a != v_b,
inference(cnf_transformation,[],[f566]) ).
tcf(c_1077,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(c_Pair(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X0,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X0,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ( X1 = X2 )
| ~ c_in(X0,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
inference(cnf_transformation,[],[f569]) ).
tcf(c_1081,negated_conjecture,
! [X0: $i] :
( ~ c_in(X0,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X0,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(cnf_transformation,[],[f573]) ).
tcf(c_1197,plain,
! [X0: $i] :
( c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X0,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ( v_a = v_b )
| ~ c_in(X0,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
inference(superposition,[status(thm)],[c_1077,c_1081]) ).
tcf(c_1338,plain,
! [X0: $i] :
( ~ c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X0,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ~ c_in(c_Relation_Oconverse(X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
inference(superposition,[status(thm)],[c_934,c_1081]) ).
tcf(c_1392,plain,
! [X0: $i] : ~ c_in(X0,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
inference(global_subsumption_just,[status(thm)],[c_1077,c_1020,c_1197,c_1075,c_1338]) ).
tcf(c_1395,plain,
$false,
inference(superposition,[status(thm)],[c_1018,c_1392]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SCT026-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.33 % Computer : n010.cluster.edu
% 0.08/0.33 % Model : x86_64 x86_64
% 0.08/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.33 % Memory : 8046.5625MB
% 0.08/0.33 % OS : Linux 6.8.0-71-generic
% 0.08/0.33 % CPULimit : 300
% 0.08/0.33 % WCLimit : 300
% 0.08/0.33 % DateTime : Thu Sep 24 08:35:43 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.37 Running first-order theorem proving
% 0.08/0.37 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.13/0.38
% 0.13/0.38 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.38
% 0.13/0.39 % Detected problem language: tptp
% 0.13/0.40 % Proving...
% 1.23/1.29 % SZS status Started for theBenchmark.p
% 1.23/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.29
% 1.23/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.23/1.29
% 1.23/1.29 % ------ iProver source info
% 1.23/1.29
% 1.23/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.23/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.23/1.29 % git: non_committed_changes: false
% 1.23/1.29
% 1.23/1.29 % ------ Parsing...% successful
% 1.23/1.29
% 1.23/1.29
% 1.23/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.23/1.29 % ------ Proving...
% 1.23/1.29 % ------ Problem Properties
% 1.23/1.29
% 1.23/1.29 %
% 1.23/1.29 % clauses 522
% 1.23/1.29 % conjectures 1
% 1.23/1.29 % EPR 23
% 1.23/1.29 % Horn 439
% 1.23/1.29 % unary 115
% 1.23/1.29 % binary 205
% 1.23/1.29 % lits 1256
% 1.23/1.29 % lits eq 257
% 1.23/1.29 % fd_pure 0
% 1.23/1.29 % fd_pseudo 0
% 1.23/1.29 % fd_cond 0
% 1.23/1.29 % fd_pseudo_cond 81
% 1.23/1.29 % AC symbols 0
% 1.23/1.29
% 1.23/1.29 % ------ Input Options Time Limit: Unbounded
% 1.23/1.29
% 1.23/1.29
% 1.23/1.29 % ------
% 1.23/1.29 % Current options:
% 1.23/1.29 % ------
% 1.23/1.29
% 1.23/1.29
% 1.23/1.29 %
% 1.23/1.29
% 1.23/1.29 % ------ Proving...
% 1.23/1.29 %
% 1.23/1.29
% 1.23/1.29 % ------ Proving...
% 1.23/1.29 %
% 1.23/1.29
% 1.23/1.29 % ------ Proving...
% 1.23/1.29 %
% 1.23/1.29
% 1.23/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.29
% 1.23/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.23/1.29
% 1.23/1.29
%------------------------------------------------------------------------------