%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET821-1 : 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 : n026.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:39 PM UTC 2026
% Result : Unsatisfiable 3.60s 1.25s
% Output : CNFRefutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 41 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 11 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f170,axiom,
! [X0,X1] :
( ~ c_less(X1,X1,X0)
| ~ class_Orderings_Oorder(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Orderings_Oorder__less__irrefl__iff1_0) ).
fof(f227,axiom,
! [X2,X0,X1] : c_in(X0,c_insert(X0,X1,X2),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
fof(f375,axiom,
! [X2,X0,X1] :
( X0 = X1
| ~ c_in(X0,c_insert(X1,c_emptyset,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsingletonD__dest_0) ).
fof(f428,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsarity_IntDef__Oint_31) ).
fof(f1434,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f1435,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f1436,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) ).
tcf(c_1531,plain,
! [X0: $i,X1: $i] :
( ~ class_Orderings_Oorder(X1)
| ~ c_less(X0,X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_1584,plain,
! [X0: $i,X1: $i,X2: $i] : c_in(X0,c_insert(X0,X1,X2),X2),
inference(cnf_transformation,[],[f227]) ).
tcf(c_1709,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X1 )
| ~ c_in(X0,c_insert(X1,c_emptyset,X2),X2) ),
inference(cnf_transformation,[],[f375]) ).
tcf(c_1733,plain,
class_Orderings_Oorder(tc_IntDef_Oint),
inference(cnf_transformation,[],[f428]) ).
tcf(c_2000,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
inference(cnf_transformation,[],[f1434]) ).
tcf(c_2001,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
inference(cnf_transformation,[],[f1435]) ).
tcf(c_2002,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,[],[f1436]) ).
tcf(c_13396,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_2002]) ).
tcf(c_13397,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
inference(demodulation,[status(thm)],[c_2001]) ).
tcf(c_13398,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
inference(demodulation,[status(thm)],[c_2000]) ).
tcf(c_18671,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_1584,c_13396]) ).
tcf(c_19106,plain,
( c_in(v_a,c_insert(v_b,c_emptyset,tc_IntDef_Oint),tc_IntDef_Oint)
| ( v_b = v_c ) ),
inference(superposition,[status(thm)],[c_18671,c_1709]) ).
tcf(c_19143,plain,
( ( v_b = v_c )
| ( v_a = v_b ) ),
inference(superposition,[status(thm)],[c_19106,c_1709]) ).
tcf(c_19156,plain,
( c_less(v_b,v_b,tc_IntDef_Oint)
| ( v_a = v_b ) ),
inference(superposition,[status(thm)],[c_19143,c_13397]) ).
tcf(c_19182,plain,
( ( v_a = v_b )
| ~ class_Orderings_Oorder(tc_IntDef_Oint) ),
inference(superposition,[status(thm)],[c_19156,c_1531]) ).
tcf(c_19183,plain,
v_a = v_b,
inference(forward_subsumption_resolution,[status(thm)],[c_19182,c_1733]) ).
tcf(c_19192,plain,
c_less(v_b,v_b,tc_IntDef_Oint),
inference(demodulation,[status(thm)],[c_13398,c_19183]) ).
tcf(c_19208,plain,
~ class_Orderings_Oorder(tc_IntDef_Oint),
inference(superposition,[status(thm)],[c_19192,c_1531]) ).
tcf(c_19209,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_19208,c_1733]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET821-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.42 % Computer : n026.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Thu Sep 24 12:06:26 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.48 Running first-order theorem proving
% 0.16/0.48 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.24/0.49
% 0.24/0.49 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.49
% 0.24/0.49 % Detected problem language: tptp
% 0.24/0.50 % Proving...
% 3.60/1.25 % SZS status Started for theBenchmark.p
% 3.60/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 3.60/1.25
% 3.60/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.60/1.25
% 3.60/1.25 % ------ iProver source info
% 3.60/1.25
% 3.60/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 3.60/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.60/1.25 % git: non_committed_changes: false
% 3.60/1.25
% 3.60/1.25 % ------ Parsing...% successful
% 3.60/1.25
% 3.60/1.25
% 3.60/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.60/1.25
% 3.60/1.25 % ------ 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 %
% 3.60/1.25
% 3.60/1.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.60/1.25
% 3.60/1.25 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.60/1.25 % ------ Proving...
% 3.60/1.25 % ------ Problem Properties
% 3.60/1.25
% 3.60/1.25 %
% 3.60/1.25 % clauses 298
% 3.60/1.25 % conjectures 3
% 3.60/1.25 % EPR 29
% 3.60/1.25 % Horn 270
% 3.60/1.25 % unary 77
% 3.60/1.25 % binary 173
% 3.60/1.25 % lits 567
% 3.60/1.25 % lits eq 162
% 3.60/1.25 % fd_pure 0
% 3.60/1.25 % fd_pseudo 0
% 3.60/1.25 % fd_cond 21
% 3.60/1.25 % fd_pseudo_cond 40
% 3.60/1.25 % AC symbols 0
% 3.60/1.25
% 3.60/1.25 % ------ Schedule dynamic 5 is on
% 3.60/1.25
% 3.60/1.25 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.60/1.25
% 3.60/1.25
% 3.60/1.25 % ------
% 3.60/1.25 % Current options:
% 3.60/1.25 % ------
% 3.60/1.25
% 3.60/1.25
% 3.60/1.25 %
% 3.60/1.25
% 3.60/1.25 % ------ Proving...
% 3.60/1.25 %
% 3.60/1.25
% 3.60/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 3.60/1.25
% 3.60/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.60/1.25
% 3.60/1.25
%------------------------------------------------------------------------------