%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM011-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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 01:04:18 PM UTC 2026
% Result : Unsatisfiable 97.82s 30.20s
% Output : CNFRefutation 97.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 70 ( 35 ~; 35 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 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 : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 66 ( 0 sgn 66 !; 0 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
fof(f205,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,X1,X3)
| ~ c_in(X0,c_minus(X1,X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffE_1) ).
fof(f379,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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
fof(f380,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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
fof(f1444,axiom,
! [X2,X3,X0,X1,X4] :
( c_in(X0,c_UNITY_Oconstrains(X4,X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_lessequals(X4,X1,tc_set(X3))
| ~ c_in(X0,c_UNITY_Oconstrains(X1,X2,X3),tc_UNITY_Oprogram(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_UNITY_Oconstrains__weaken__L_0) ).
fof(f1449,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_WFair_Oensures(X1,X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X0,c_WFair_Otransient(c_minus(X1,X2,tc_set(X3)),X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X0,c_UNITY_Oconstrains(c_minus(X1,X2,tc_set(X3)),c_union(X1,X2,X3),X3),tc_UNITY_Oprogram(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_OensuresI_0) ).
fof(f1450,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_WFair_OleadsTo(X1,X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X0,c_WFair_Oensures(X1,X2,X3),tc_UNITY_Oprogram(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_OleadsTo__Basis_0) ).
fof(f1451,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_WFair_Otransient(X3,X2),tc_UNITY_Oprogram(X2))
| ~ c_lessequals(X3,X1,tc_set(X2))
| ~ c_in(X0,c_WFair_Otransient(X1,X2),tc_UNITY_Oprogram(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_Otransient__strengthen_0) ).
fof(f1452,negated_conjecture,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f1453,negated_conjecture,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f1454,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
tcf(c_1580,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,X1,X3)
| ~ c_in(X0,c_minus(X1,X2,tc_set(X3)),X3) ),
inference(cnf_transformation,[],[f205]) ).
tcf(c_1727,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,[],[f379]) ).
tcf(c_1728,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,[],[f380]) ).
tcf(c_2022,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( c_in(X0,c_UNITY_Oconstrains(X4,X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_lessequals(X4,X1,tc_set(X3))
| ~ c_in(X0,c_UNITY_Oconstrains(X1,X2,X3),tc_UNITY_Oprogram(X3)) ),
inference(cnf_transformation,[],[f1444]) ).
tcf(c_2025,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,c_WFair_Oensures(X1,X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X0,c_WFair_Otransient(c_minus(X1,X2,tc_set(X3)),X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X0,c_UNITY_Oconstrains(c_minus(X1,X2,tc_set(X3)),c_union(X1,X2,X3),X3),tc_UNITY_Oprogram(X3)) ),
inference(cnf_transformation,[],[f1449]) ).
tcf(c_2026,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,c_WFair_OleadsTo(X1,X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X0,c_WFair_Oensures(X1,X2,X3),tc_UNITY_Oprogram(X3)) ),
inference(cnf_transformation,[],[f1450]) ).
tcf(c_2027,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,c_WFair_Otransient(X3,X2),tc_UNITY_Oprogram(X2))
| ~ c_lessequals(X3,X1,tc_set(X2))
| ~ c_in(X0,c_WFair_Otransient(X1,X2),tc_UNITY_Oprogram(X2)) ),
inference(cnf_transformation,[],[f1451]) ).
tcf(c_2028,negated_conjecture,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
inference(cnf_transformation,[],[f1452]) ).
tcf(c_2029,negated_conjecture,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
inference(cnf_transformation,[],[f1453]) ).
tcf(c_2030,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
inference(cnf_transformation,[],[f1454]) ).
tcf(c_16279,plain,
! [X0: $i] :
( c_in(v_F,c_WFair_Otransient(X0,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(X0,v_A,tc_set(t_a))
| ~ c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(instantiation,[status(thm)],[c_2027]) ).
tcf(c_31109,plain,
! [X0: $i,X1: $i] :
( c_in(v_F,c_WFair_Otransient(c_minus(X0,X1,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))
| ~ c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(c_minus(X0,X1,tc_set(t_a)),v_A,tc_set(t_a)) ),
inference(instantiation,[status(thm)],[c_16279]) ).
tcf(c_46515,plain,
( c_in(v_F,c_WFair_Otransient(c_minus(v_A,v_B,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))
| ~ c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)) ),
inference(instantiation,[status(thm)],[c_31109]) ).
tcf(c_49852,plain,
! [X0: $i] :
( c_in(v_F,c_UNITY_Oconstrains(X0,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(X0,v_A,tc_set(t_a)) ),
inference(superposition,[status(thm)],[c_2028,c_2022]) ).
tcf(c_54401,plain,
( c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a))
| ~ c_in(v_F,c_WFair_Otransient(c_minus(v_A,v_B,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a)) ),
inference(superposition,[status(thm)],[c_49852,c_2025]) ).
tcf(c_54653,plain,
( c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)) ),
inference(global_subsumption_just,[status(thm)],[c_54401,c_2029,c_46515,c_54401]) ).
tcf(c_58101,plain,
( c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(instantiation,[status(thm)],[c_2026]) ).
tcf(c_73090,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(c_minus(X0,X1,tc_set(X2)),X3,tc_set(X2))
| c_in(c_Main_OsubsetI__1(c_minus(X0,X1,tc_set(X2)),X3,X2),X0,X2) ),
inference(superposition,[status(thm)],[c_1727,c_1580]) ).
tcf(c_73177,plain,
! [X0: $i,X1: $i,X2: $i] : c_lessequals(c_minus(X0,X1,tc_set(X2)),X0,tc_set(X2)),
inference(superposition,[status(thm)],[c_73090,c_1728]) ).
tcf(c_83649,plain,
! [X0: $i] :
( c_in(v_F,c_UNITY_Oconstrains(X0,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(X0,v_A,tc_set(t_a)) ),
inference(superposition,[status(thm)],[c_2028,c_2022]) ).
tcf(c_92275,plain,
( c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a))
| ~ c_in(v_F,c_WFair_Otransient(c_minus(v_A,v_B,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a)) ),
inference(superposition,[status(thm)],[c_83649,c_2025]) ).
tcf(c_92600,plain,
~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)),
inference(global_subsumption_just,[status(thm)],[c_92275,c_2030,c_54653,c_58101]) ).
tcf(c_92602,plain,
$false,
inference(superposition,[status(thm)],[c_73177,c_92600]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM011-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/12.62 % Computer : n013.cluster.edu
% 0.08/12.62 % Model : x86_64 x86_64
% 0.08/12.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/12.62 % Memory : 8046.5625MB
% 0.08/12.62 % OS : Linux 6.8.0-71-generic
% 0.08/12.62 % CPULimit : 300
% 0.08/12.62 % WCLimit : 300
% 0.08/12.62 % DateTime : Fri Sep 25 07:45:37 UTC 2026
% 0.08/12.62 % CPUTime :
% 0.08/12.62 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/12.66 Running first-order theorem proving
% 0.08/12.66 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.08/12.67
% 0.08/12.67 % ======== iProver multi-core TPTP/SMT =========
% 0.08/12.67
% 0.08/12.67 % Detected problem language: tptp
% 0.08/12.68 % Proving...
% 97.82/30.20 % SZS status Started for theBenchmark.p
% 97.82/30.20 % SZS status Unsatisfiable for theBenchmark.p
% 97.82/30.20
% 97.82/30.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 97.82/30.20
% 97.82/30.20 % ------ iProver source info
% 97.82/30.20
% 97.82/30.20 % git: date: 2026-07-19 20:42:38 +0200
% 97.82/30.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 97.82/30.20 % git: non_committed_changes: false
% 97.82/30.20
% 97.82/30.20 % ------ Parsing...% successful
% 97.82/30.20
% 97.82/30.20
% 97.82/30.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 97.82/30.20
% 97.82/30.20 % ------ Preprocessing... sup_sim: 1 sf_s rm: 18 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e sup_sim: 0 sf_s rm: 30 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 30 0s sf_e pe_s pe_e %
% 97.82/30.20
% 97.82/30.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 97.82/30.20
% 97.82/30.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 97.82/30.20 % ------ Proving...
% 97.82/30.20 % ------ Problem Properties
% 97.82/30.20
% 97.82/30.20 %
% 97.82/30.20 % clauses 310
% 97.82/30.20 % conjectures 3
% 97.82/30.20 % EPR 26
% 97.82/30.20 % Horn 283
% 97.82/30.20 % unary 84
% 97.82/30.20 % binary 176
% 97.82/30.20 % lits 586
% 97.82/30.20 % lits eq 166
% 97.82/30.20 % fd_pure 0
% 97.82/30.20 % fd_pseudo 0
% 97.82/30.20 % fd_cond 23
% 97.82/30.20 % fd_pseudo_cond 40
% 97.82/30.20 % AC symbols 0
% 97.82/30.20
% 97.82/30.20 % ------ Input Options Time Limit: Unbounded
% 97.82/30.20
% 97.82/30.20
% 97.82/30.20 % ------
% 97.82/30.20 % Current options:
% 97.82/30.20 % ------
% 97.82/30.20
% 97.82/30.20
% 97.82/30.20 %
% 97.82/30.20
% 97.82/30.20 % ------ Proving...
% 97.82/30.20 %
% 97.82/30.20
% 97.82/30.20 % SZS status Unsatisfiable for theBenchmark.p
% 97.82/30.20
% 97.82/30.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 97.82/30.21
% 97.82/30.21
%------------------------------------------------------------------------------