%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET855-2 : 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 : n019.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:48 PM UTC 2026
% Result : Unsatisfiable 1.62s 16.51s
% Output : CNFRefutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 15 unt; 3 def)
% Number of atoms : 52 ( 14 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 26 ( 15 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 6 ( 4 usr; 4 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( X1 = X0
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
fof(f2,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(reorient_equations,[],[f1]) ).
fof(f3,negated_conjecture,
c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f4,negated_conjecture,
c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
fof(f5,negated_conjecture,
v_n != c_Union(v_Y,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X1 )
| ~ c_lessequals(X1,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_55,negated_conjecture,
c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_56,negated_conjecture,
c_Union(v_Y,tc_set(t_a)) != v_n,
inference(cnf_transformation,[],[f5]) ).
tcf(c_79,definition,
iPr_def_10 = tc_set(t_a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_80,definition,
iPr_def_11 = c_Union(v_Y,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_81,definition,
iPr_def_12 = tc_set(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_82,negated_conjecture,
iPr_def_11 != v_n,
inference(demodulation,[status(thm)],[c_56,c_79,c_80]) ).
tcf(c_83,negated_conjecture,
c_lessequals(iPr_def_11,v_n,iPr_def_12),
inference(demodulation,[status(thm)],[c_55,c_81]) ).
tcf(c_84,negated_conjecture,
c_lessequals(v_n,iPr_def_11,iPr_def_12),
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_193,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ c_lessequals(X1,X0,iPr_def_12)
| ~ c_lessequals(X0,X1,tc_set(iPr_def_10)) ),
inference(superposition,[status(thm)],[c_81,c_53]) ).
tcf(c_194,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ c_lessequals(X1,X0,iPr_def_12)
| ~ c_lessequals(X0,X1,iPr_def_12) ),
inference(light_normalisation,[status(thm)],[c_193,c_81]) ).
tcf(c_209,plain,
( ( v_n = iPr_def_11 )
| ~ c_lessequals(iPr_def_11,v_n,iPr_def_12) ),
inference(superposition,[status(thm)],[c_84,c_194]) ).
tcf(c_210,plain,
v_n = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_209,c_83]) ).
tcf(c_211,plain,
iPr_def_11 != iPr_def_11,
inference(demodulation,[status(thm)],[c_82,c_210]) ).
tcf(c_214,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET855-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/15.61 % Computer : n019.cluster.edu
% 0.11/15.61 % Model : x86_64 x86_64
% 0.11/15.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.61 % Memory : 8046.5625MB
% 0.11/15.61 % OS : Linux 6.8.0-71-generic
% 0.11/15.61 % CPULimit : 300
% 0.11/15.61 % WCLimit : 300
% 0.11/15.61 % DateTime : Thu Sep 24 12:15:24 UTC 2026
% 0.11/15.61 % CPUTime :
% 0.11/15.61 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/15.64 Running first-order theorem proving
% 0.11/15.64 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.11/15.65
% 0.11/15.65 % ======== iProver multi-core TPTP/SMT =========
% 0.11/15.65
% 0.11/15.65 % Detected problem language: tptp
% 0.11/15.67 % Proving...
% 1.62/16.51 % SZS status Started for theBenchmark.p
% 1.62/16.51 % SZS status Unsatisfiable for theBenchmark.p
% 1.62/16.51
% 1.62/16.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.62/16.51
% 1.62/16.51 % ------ iProver source info
% 1.62/16.51
% 1.62/16.51 % git: date: 2026-07-19 20:42:38 +0200
% 1.62/16.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.62/16.51 % git: non_committed_changes: false
% 1.62/16.51
% 1.62/16.51 % ------ Parsing...% successful
% 1.62/16.51
% 1.62/16.51
% 1.62/16.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.62/16.51
% 1.62/16.51 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.62/16.51
% 1.62/16.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.62/16.51
% 1.62/16.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.62/16.51 % ------ Proving...
% 1.62/16.51 % ------ Problem Properties
% 1.62/16.51
% 1.62/16.51 %
% 1.62/16.51 % clauses 7
% 1.62/16.51 % conjectures 3
% 1.62/16.51 % EPR 3
% 1.62/16.51 % Horn 7
% 1.62/16.51 % unary 6
% 1.62/16.51 % binary 0
% 1.62/16.51 % lits 9
% 1.62/16.51 % lits eq 5
% 1.62/16.51 % fd_pure 0
% 1.62/16.51 % fd_pseudo 0
% 1.62/16.51 % fd_cond 0
% 1.62/16.51 % fd_pseudo_cond 1
% 1.62/16.51 % AC symbols 0
% 1.62/16.51
% 1.62/16.51 % ------ Schedule dynamic 5 is on
% 1.62/16.51
% 1.62/16.51 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.62/16.51
% 1.62/16.51
% 1.62/16.51 % ------
% 1.62/16.51 % Current options:
% 1.62/16.51 % ------
% 1.62/16.51
% 1.62/16.51
% 1.62/16.51 %
% 1.62/16.51
% 1.62/16.51 % ------ Proving...
% 1.62/16.51 %
% 1.62/16.51
% 1.62/16.51 % SZS status Unsatisfiable for theBenchmark.p
% 1.62/16.51
% 1.62/16.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.62/16.51
% 1.62/16.51
%------------------------------------------------------------------------------