%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET864-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 : n012.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:51 PM UTC 2026
% Result : Unsatisfiable 0.28s 1.09s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 32 ( 13 unt; 4 def)
% Number of atoms : 111 ( 18 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 71 ( 38 ~; 33 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 8 ( 6 usr; 5 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] :
( c_Union(X3,X2) = X0
| ~ c_lessequals(c_Union(X3,X2),X0,tc_set(X2))
| ~ c_in(X3,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
fof(f2,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f3,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f4,negated_conjecture,
! [X0] :
( ~ c_in(X0,v_S,tc_set(t_a))
| c_in(v_x(X0),v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
fof(f5,negated_conjecture,
! [X0] :
( ~ c_in(X0,v_S,tc_set(t_a))
| c_lessequals(X0,v_x(X0),tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
fof(f6,negated_conjecture,
! [X0] :
( ~ c_in(X0,v_S,tc_set(t_a))
| X0 != v_x(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
fof(f7,plain,
! [X0] :
( ~ c_in(X0,v_S,tc_set(t_a))
| v_x(X0) != X0 ),
inference(reorient_equations,[],[f6]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( c_Union(X0,X2) = X3 )
| ~ c_in(X3,X1,tc_set(X2))
| ~ c_lessequals(c_Union(X0,X2),X3,tc_set(X2))
| ~ c_in(X0,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] :
( c_in(v_x(X0),v_S,tc_set(t_a))
| ~ c_in(X0,v_S,tc_set(t_a)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,negated_conjecture,
! [X0: $i] :
( c_lessequals(X0,v_x(X0),tc_set(t_a))
| ~ c_in(X0,v_S,tc_set(t_a)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] :
( ~ c_in(X0,v_S,tc_set(t_a))
| ( v_x(X0) != X0 ) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_138,definition,
iPr_def_10 = tc_set(t_a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_139,definition,
iPr_def_11 = c_Union(v_c,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_140,definition,
iPr_def_12 = c_Zorn_Omaxchain(v_S,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_141,definition,
iPr_def_13 = tc_set(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_142,negated_conjecture,
! [X0: $i] :
( ~ c_in(X0,v_S,iPr_def_10)
| ( v_x(X0) != X0 ) ),
inference(demodulation,[status(thm)],[c_60,c_138]) ).
tcf(c_143,negated_conjecture,
! [X0: $i] :
( c_lessequals(X0,v_x(X0),iPr_def_10)
| ~ c_in(X0,v_S,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_59]) ).
tcf(c_144,negated_conjecture,
! [X0: $i] :
( c_in(v_x(X0),v_S,iPr_def_10)
| ~ c_in(X0,v_S,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_145,negated_conjecture,
c_in(iPr_def_11,v_S,iPr_def_10),
inference(demodulation,[status(thm)],[c_57,c_139]) ).
tcf(c_146,negated_conjecture,
c_in(v_c,iPr_def_12,iPr_def_13),
inference(demodulation,[status(thm)],[c_56,c_141,c_140]) ).
tcf(c_335,plain,
! [X0: $i,X1: $i] :
( ( c_Union(X0,t_a) = X1 )
| ~ c_in(X1,v_S,tc_set(t_a))
| ~ c_in(X0,iPr_def_12,tc_set(tc_set(t_a)))
| ~ c_lessequals(c_Union(X0,t_a),X1,tc_set(t_a)) ),
inference(superposition,[status(thm)],[c_140,c_55]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i] :
( ( c_Union(X0,t_a) = X1 )
| ~ c_in(X1,v_S,iPr_def_10)
| ~ c_in(X0,iPr_def_12,iPr_def_13)
| ~ c_lessequals(c_Union(X0,t_a),X1,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_335,c_138,c_141]) ).
tcf(c_365,plain,
! [X0: $i] :
( ( c_Union(v_c,t_a) = X0 )
| ~ c_in(v_c,iPr_def_12,iPr_def_13)
| ~ c_lessequals(iPr_def_11,X0,iPr_def_10)
| ~ c_in(X0,v_S,iPr_def_10) ),
inference(superposition,[status(thm)],[c_139,c_338]) ).
tcf(c_366,plain,
! [X0: $i] :
( ( X0 = iPr_def_11 )
| ~ c_in(v_c,iPr_def_12,iPr_def_13)
| ~ c_lessequals(iPr_def_11,X0,iPr_def_10)
| ~ c_in(X0,v_S,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_365,c_139]) ).
tcf(c_367,plain,
! [X0: $i] :
( ( X0 = iPr_def_11 )
| ~ c_lessequals(iPr_def_11,X0,iPr_def_10)
| ~ c_in(X0,v_S,iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_366,c_146]) ).
tcf(c_383,plain,
! [X0: $i] :
( ( v_x(X0) = iPr_def_11 )
| ~ c_in(X0,v_S,iPr_def_10)
| ~ c_lessequals(iPr_def_11,v_x(X0),iPr_def_10) ),
inference(superposition,[status(thm)],[c_144,c_367]) ).
tcf(c_395,plain,
( ( v_x(iPr_def_11) = iPr_def_11 )
| ~ c_in(iPr_def_11,v_S,iPr_def_10) ),
inference(superposition,[status(thm)],[c_143,c_383]) ).
tcf(c_396,plain,
v_x(iPr_def_11) = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_395,c_145]) ).
tcf(c_398,plain,
~ c_in(iPr_def_11,v_S,iPr_def_10),
inference(superposition,[status(thm)],[c_396,c_142]) ).
tcf(c_401,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_398,c_145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET864-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Thu Sep 24 12:17:22 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.33 Running first-order theorem proving
% 0.02/0.33 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.02/0.34
% 0.02/0.34 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.34
% 0.02/0.34 % Detected problem language: tptp
% 0.02/0.35 % Proving...
% 0.28/1.09 % SZS status Started for theBenchmark.p
% 0.28/1.09 % SZS status Unsatisfiable for theBenchmark.p
% 0.28/1.09
% 0.28/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.28/1.09
% 0.28/1.09 % ------ iProver source info
% 0.28/1.09
% 0.28/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 0.28/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.28/1.09 % git: non_committed_changes: false
% 0.28/1.09
% 0.28/1.09 % ------ Parsing...% successful
% 0.28/1.09
% 0.28/1.09
% 0.28/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.28/1.09
% 0.28/1.09 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.28/1.09
% 0.28/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.28/1.09
% 0.28/1.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.28/1.09 % ------ Proving...
% 0.28/1.09 % ------ Problem Properties
% 0.28/1.09
% 0.28/1.09 %
% 0.28/1.09 % clauses 10
% 0.28/1.09 % conjectures 5
% 0.28/1.09 % EPR 2
% 0.28/1.09 % Horn 10
% 0.28/1.09 % unary 6
% 0.28/1.09 % binary 3
% 0.28/1.09 % lits 16
% 0.28/1.09 % lits eq 6
% 0.28/1.09 % fd_pure 0
% 0.28/1.09 % fd_pseudo 0
% 0.28/1.09 % fd_cond 0
% 0.28/1.09 % fd_pseudo_cond 1
% 0.28/1.09 % AC symbols 0
% 0.28/1.09
% 0.28/1.09 % ------ Schedule dynamic 5 is on
% 0.28/1.09
% 0.28/1.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.28/1.09
% 0.28/1.09
% 0.28/1.09 % ------
% 0.28/1.09 % Current options:
% 0.28/1.09 % ------
% 0.28/1.09
% 0.28/1.09
% 0.28/1.09 %
% 0.28/1.09
% 0.28/1.09 % ------ Proving...
% 0.28/1.09 %
% 0.28/1.09
% 0.28/1.09 % SZS status Unsatisfiable for theBenchmark.p
% 0.28/1.09
% 0.28/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.28/1.09
% 0.28/1.09
%------------------------------------------------------------------------------