%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET860-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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:48:50 PM UTC 2026
% Result : Unsatisfiable 4.07s 1.28s
% Output : CNFRefutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 64 ( 31 ~; 33 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 51 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,negated_conjecture,
! [X0] :
( ~ c_in(X0,v_C,tc_set(t_a))
| c_lessequals(X0,v_A,tc_set(t_a))
| c_lessequals(v_B,X0,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f14,axiom,
! [X2,X0,X1] :
( c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2))
| ~ c_in(X0,c_Union(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionE_0) ).
fof(f15,axiom,
! [X2,X0,X1] :
( c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2)
| ~ c_in(X0,c_Union(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionE_1) ).
fof(f16,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_Union(X3,X2),X2)
| ~ c_in(X1,X3,tc_set(X2))
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionI_0) ).
fof(f21,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,X3,X2)
| ~ c_lessequals(X1,X3,tc_set(X2))
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
fof(f22,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
fof(f23,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,X1,tc_set(X2))
| ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
tcf(c_73,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_74,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_75,negated_conjecture,
! [X0: $i] :
( c_lessequals(v_B,X0,tc_set(t_a))
| c_lessequals(X0,v_A,tc_set(t_a))
| ~ c_in(X0,v_C,tc_set(t_a)) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2))
| ~ c_in(X0,c_Union(X1,X2),X2) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2)
| ~ c_in(X0,c_Union(X1,X2),X2) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X3,c_Union(X1,X2),X2)
| ~ c_in(X3,X0,X2)
| ~ c_in(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X3,X1,X2)
| ~ c_in(X3,X0,X2)
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X1,tc_set(X2))
| c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X1,tc_set(X2))
| ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_916,plain,
( c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a))
| c_in(c_Main_OsubsetI__1(v_B,c_Union(v_C,t_a),t_a),v_B,t_a) ),
inference(instantiation,[status(thm)],[c_94]) ).
tcf(c_938,plain,
( c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(v_B,c_Union(v_C,t_a),t_a),c_Union(v_C,t_a),t_a) ),
inference(instantiation,[status(thm)],[c_95]) ).
tcf(c_1151,plain,
! [X0: $i] :
( c_in(c_Main_OsubsetI__1(v_B,c_Union(v_C,t_a),t_a),X0,t_a)
| ~ c_lessequals(v_B,X0,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(v_B,c_Union(v_C,t_a),t_a),v_B,t_a) ),
inference(instantiation,[status(thm)],[c_93]) ).
tcf(c_1719,plain,
! [X0: $i] :
( c_in(c_Main_OsubsetI__1(v_B,c_Union(v_C,t_a),t_a),c_Union(v_C,t_a),t_a)
| ~ c_in(X0,v_C,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(v_B,c_Union(v_C,t_a),t_a),X0,t_a) ),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_2541,plain,
! [X0: $i] :
( ~ c_in(X0,v_C,tc_set(t_a))
| c_lessequals(X0,v_A,tc_set(t_a)) ),
inference(global_subsumption_just,[status(thm)],[c_75,c_74,c_75,c_916,c_938,c_1151,c_1719]) ).
tcf(c_2542,negated_conjecture,
! [X0: $i] :
( c_lessequals(X0,v_A,tc_set(t_a))
| ~ c_in(X0,v_C,tc_set(t_a)) ),
inference(renaming,[status(thm)],[c_2541]) ).
tcf(c_2583,plain,
! [X0: $i] :
( c_lessequals(c_Main_OUnionE__1(X0,v_C,t_a),v_A,tc_set(t_a))
| ~ c_in(X0,c_Union(v_C,t_a),t_a) ),
inference(superposition,[status(thm)],[c_86,c_2542]) ).
tcf(c_2661,plain,
! [X0: $i,X1: $i] :
( c_in(X0,v_A,t_a)
| ~ c_in(X1,c_Union(v_C,t_a),t_a)
| ~ c_in(X0,c_Main_OUnionE__1(X1,v_C,t_a),t_a) ),
inference(superposition,[status(thm)],[c_2583,c_93]) ).
tcf(c_2665,plain,
! [X0: $i] :
( c_in(X0,v_A,t_a)
| ~ c_in(X0,c_Union(v_C,t_a),t_a) ),
inference(superposition,[status(thm)],[c_87,c_2661]) ).
tcf(c_2670,plain,
! [X0: $i] :
( c_lessequals(c_Union(v_C,t_a),X0,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_Union(v_C,t_a),X0,t_a),v_A,t_a) ),
inference(superposition,[status(thm)],[c_94,c_2665]) ).
tcf(c_2681,plain,
c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
inference(superposition,[status(thm)],[c_2670,c_95]) ).
tcf(c_2682,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2681,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET860-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 12:15:51 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 4.07/1.28 % SZS status Started for theBenchmark.p
% 4.07/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 4.07/1.28
% 4.07/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.07/1.28
% 4.07/1.28 % ------ iProver source info
% 4.07/1.28
% 4.07/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.07/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.07/1.28 % git: non_committed_changes: false
% 4.07/1.28
% 4.07/1.28 % ------ Parsing...% successful
% 4.07/1.28
% 4.07/1.28
% 4.07/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.07/1.28
% 4.07/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.07/1.28
% 4.07/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.07/1.28
% 4.07/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.07/1.28 % ------ Proving...
% 4.07/1.28 % ------ Problem Properties
% 4.07/1.28
% 4.07/1.28 %
% 4.07/1.28 % clauses 24
% 4.07/1.28 % conjectures 3
% 4.07/1.28 % EPR 2
% 4.07/1.28 % Horn 19
% 4.07/1.28 % unary 5
% 4.07/1.28 % binary 12
% 4.07/1.28 % lits 50
% 4.07/1.28 % lits eq 2
% 4.07/1.28 % fd_pure 0
% 4.07/1.28 % fd_pseudo 0
% 4.07/1.28 % fd_cond 0
% 4.07/1.28 % fd_pseudo_cond 2
% 4.07/1.28 % AC symbols 0
% 4.07/1.28
% 4.07/1.28 % ------ Input Options Time Limit: Unbounded
% 4.07/1.28
% 4.07/1.28
% 4.07/1.28 % ------
% 4.07/1.28 % Current options:
% 4.07/1.28 % ------
% 4.07/1.28
% 4.07/1.28
% 4.07/1.28 %
% 4.07/1.28
% 4.07/1.28 % ------ Proving...
% 4.07/1.28 %
% 4.07/1.28
% 4.07/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 4.07/1.28
% 4.07/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.07/1.28
% 4.07/1.28
%------------------------------------------------------------------------------