%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET821-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 : n003.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:40 PM UTC 2026
% Result : Unsatisfiable 1.81s 1.27s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 18 unt; 0 def)
% Number of atoms : 71 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 36 ~; 31 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 53 ( 0 sgn 53 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ c_less(X1,X1,X0)
| ~ class_Orderings_Oorder(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__less__irrefl__iff1_0) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ c_in(X0,c_uminus(X1,tc_set(X2)),X2)
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OComplD__dest_0) ).
fof(f4,axiom,
! [X2,X3,X0,X1] :
( c_in(X0,c_insert(X3,X1,X2),X2)
| ~ c_in(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_0) ).
fof(f5,axiom,
! [X2,X0,X1] : c_in(X0,c_insert(X0,X1,X2),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
fof(f6,axiom,
! [X2,X3,X0,X1] :
( X0 = X1
| c_in(X0,X2,X3)
| ~ c_in(X0,c_insert(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
fof(f7,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f8,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f9,negated_conjecture,
! [X0] :
( c_in(v_a,X0,tc_IntDef_Oint)
| ~ c_in(v_b,X0,tc_IntDef_Oint)
| c_in(v_c,X0,tc_IntDef_Oint) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f10,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_IntDef__Oint_31) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ~ class_Orderings_Oorder(X1)
| ~ c_less(X0,X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ c_in(X0,X1,X2)
| ~ c_in(X0,c_uminus(X1,tc_set(X2)),X2) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,c_insert(X3,X1,X2),X2)
| ~ c_in(X0,X1,X2) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : c_in(X0,c_insert(X0,X1,X2),X2),
inference(cnf_transformation,[],[f5]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,X2,X3)
| ( X0 = X1 )
| ~ c_in(X0,c_insert(X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,negated_conjecture,
! [X0: $i] :
( c_in(v_c,X0,tc_IntDef_Oint)
| c_in(v_a,X0,tc_IntDef_Oint)
| ~ c_in(v_b,X0,tc_IntDef_Oint) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_68,plain,
class_Orderings_Oorder(tc_IntDef_Oint),
inference(cnf_transformation,[],[f10]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( ~ class_Orderings_Oorder(X1)
| ~ c_less(X0,X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_175,plain,
! [X0: $i,X1: $i] :
( ~ c_less(X1,X1,X0)
| ( X0 != tc_IntDef_Oint ) ),
inference(resolution_lifted,[status(thm)],[c_79,c_68]) ).
tcf(c_176,plain,
! [X0: $i] : ~ c_less(X0,X0,tc_IntDef_Oint),
inference(unflattening,[status(thm)],[c_175]) ).
tcf(c_182,plain,
! [X0: $i] :
( ( tc_IntDef_Oint != tc_IntDef_Oint )
| ( X0 != v_b )
| ( X0 != v_a ) ),
inference(resolution_lifted,[status(thm)],[c_65,c_176]) ).
tcf(c_183,plain,
v_a != v_b,
inference(unflattening,[status(thm)],[c_182]) ).
tcf(c_187,plain,
! [X0: $i] :
( ( tc_IntDef_Oint != tc_IntDef_Oint )
| ( X0 != v_c )
| ( X0 != v_b ) ),
inference(resolution_lifted,[status(thm)],[c_66,c_176]) ).
tcf(c_188,plain,
v_b != v_c,
inference(unflattening,[status(thm)],[c_187]) ).
tcf(c_275,plain,
v_b != v_c,
inference(demodulation,[status(thm)],[c_188]) ).
tcf(c_276,plain,
v_a != v_b,
inference(demodulation,[status(thm)],[c_183]) ).
tcf(c_277,negated_conjecture,
! [X0: $i] :
( c_in(v_c,X0,tc_IntDef_Oint)
| c_in(v_a,X0,tc_IntDef_Oint)
| ~ c_in(v_b,X0,tc_IntDef_Oint) ),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_470,plain,
! [X0: $i] :
( c_in(v_c,c_insert(v_b,X0,tc_IntDef_Oint),tc_IntDef_Oint)
| c_in(v_a,c_insert(v_b,X0,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(superposition,[status(thm)],[c_63,c_277]) ).
tcf(c_526,plain,
! [X0: $i] :
( c_in(v_c,X0,tc_IntDef_Oint)
| c_in(v_a,c_insert(v_b,X0,tc_IntDef_Oint),tc_IntDef_Oint)
| ( v_b = v_c ) ),
inference(superposition,[status(thm)],[c_470,c_64]) ).
tcf(c_528,plain,
! [X0: $i] :
( c_in(v_c,X0,tc_IntDef_Oint)
| c_in(v_a,c_insert(v_b,X0,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(forward_subsumption_resolution,[status(thm)],[c_526,c_275]) ).
tcf(c_541,plain,
! [X0: $i] :
( c_in(v_c,X0,tc_IntDef_Oint)
| c_in(v_a,X0,tc_IntDef_Oint)
| ( v_a = v_b ) ),
inference(superposition,[status(thm)],[c_528,c_64]) ).
tcf(c_542,plain,
! [X0: $i] :
( c_in(v_c,X0,tc_IntDef_Oint)
| c_in(v_a,X0,tc_IntDef_Oint) ),
inference(forward_subsumption_resolution,[status(thm)],[c_541,c_276]) ).
tcf(c_550,plain,
! [X0: $i] :
( c_in(v_a,c_uminus(X0,tc_set(tc_IntDef_Oint)),tc_IntDef_Oint)
| ~ c_in(v_c,X0,tc_IntDef_Oint) ),
inference(superposition,[status(thm)],[c_542,c_60]) ).
tcf(c_563,plain,
! [X0: $i] :
( ~ c_in(v_c,X0,tc_IntDef_Oint)
| ~ c_in(v_a,X0,tc_IntDef_Oint) ),
inference(superposition,[status(thm)],[c_550,c_60]) ).
tcf(c_573,plain,
! [X0: $i] : ~ c_in(v_c,c_insert(v_a,X0,tc_IntDef_Oint),tc_IntDef_Oint),
inference(superposition,[status(thm)],[c_63,c_563]) ).
tcf(c_589,plain,
! [X0: $i] : ~ c_in(v_c,X0,tc_IntDef_Oint),
inference(superposition,[status(thm)],[c_62,c_573]) ).
tcf(c_591,plain,
! [X0: $i] : c_in(v_a,X0,tc_IntDef_Oint),
inference(backward_subsumption_resolution,[status(thm)],[c_542,c_589]) ).
tcf(c_595,plain,
! [X0: $i] : ~ c_in(v_a,X0,tc_IntDef_Oint),
inference(superposition,[status(thm)],[c_591,c_60]) ).
tcf(c_597,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_595,c_591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET821-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.36 % Computer : n003.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 12:05:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 1.81/1.27 % SZS status Started for theBenchmark.p
% 1.81/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.81/1.27
% 1.81/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.81/1.27
% 1.81/1.27 % ------ iProver source info
% 1.81/1.27
% 1.81/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.81/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.81/1.27 % git: non_committed_changes: false
% 1.81/1.27
% 1.81/1.27 % ------ Parsing...% successful
% 1.81/1.27
% 1.81/1.27
% 1.81/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.81/1.27
% 1.81/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 1.81/1.27
% 1.81/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.81/1.27
% 1.81/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.81/1.27 % ------ Proving...
% 1.81/1.27 % ------ Problem Properties
% 1.81/1.27
% 1.81/1.27 %
% 1.81/1.27 % clauses 8
% 1.81/1.27 % conjectures 1
% 1.81/1.27 % EPR 3
% 1.81/1.27 % Horn 5
% 1.81/1.27 % unary 3
% 1.81/1.27 % binary 3
% 1.81/1.27 % lits 15
% 1.81/1.27 % lits eq 3
% 1.81/1.27 % fd_pure 0
% 1.81/1.27 % fd_pseudo 0
% 1.81/1.27 % fd_cond 0
% 1.81/1.27 % fd_pseudo_cond 1
% 1.81/1.27 % AC symbols 0
% 1.81/1.27
% 1.81/1.27 % ------ Schedule dynamic 5 is on
% 1.81/1.27
% 1.81/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.81/1.27
% 1.81/1.27
% 1.81/1.27 % ------
% 1.81/1.27 % Current options:
% 1.81/1.27 % ------
% 1.81/1.27
% 1.81/1.27
% 1.81/1.27 %
% 1.81/1.27
% 1.81/1.27 % ------ Proving...
% 1.81/1.27 %
% 1.81/1.27
% 1.81/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.81/1.27
% 1.81/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.81/1.27
% 1.81/1.27
%------------------------------------------------------------------------------