%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET864-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 : n006.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 4.10s 1.30s
% Output : CNFRefutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 39 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 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 : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1435,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/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
fof(f1437,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f1439,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f1440,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/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
fof(f1441,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/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
fof(f1442,negated_conjecture,
! [X0] :
( ~ c_in(X0,v_S,tc_set(t_a))
| X0 != v_x(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
fof(f1443,plain,
! [X0] :
( ~ c_in(X0,v_S,tc_set(t_a))
| v_x(X0) != X0 ),
inference(reorient_equations,[],[f1442]) ).
tcf(c_1415,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[],[f1437]) ).
tcf(c_1417,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
inference(cnf_transformation,[],[f1439]) ).
tcf(c_1418,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,[],[f1440]) ).
tcf(c_1419,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,[],[f1441]) ).
tcf(c_1420,negated_conjecture,
! [X0: $i] :
( ~ c_in(X0,v_S,tc_set(t_a))
| ( v_x(X0) != X0 ) ),
inference(cnf_transformation,[],[f1443]) ).
tcf(c_1421,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,[],[f1435]) ).
tcf(c_5112,plain,
! [X0: $i] :
( ( c_Union(v_c,t_a) = X0 )
| ~ c_in(X0,v_S,tc_set(t_a))
| ~ c_lessequals(c_Union(v_c,t_a),X0,tc_set(t_a)) ),
inference(superposition,[status(thm)],[c_1415,c_1421]) ).
tcf(c_5182,plain,
( ( v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a) )
| ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
| ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)) ),
inference(superposition,[status(thm)],[c_1419,c_5112]) ).
tcf(c_5184,plain,
( ( v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a) )
| ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5182,c_1417]) ).
tcf(c_5191,plain,
( ( v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a) )
| ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)) ),
inference(superposition,[status(thm)],[c_1418,c_5184]) ).
tcf(c_5192,plain,
v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a),
inference(forward_subsumption_resolution,[status(thm)],[c_5191,c_1417]) ).
tcf(c_5197,plain,
~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
inference(superposition,[status(thm)],[c_5192,c_1420]) ).
tcf(c_5202,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5197,c_1417]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET864-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.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 12:17:41 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.42 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/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 4.10/1.30 % SZS status Started for theBenchmark.p
% 4.10/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.10/1.30
% 4.10/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.10/1.30
% 4.10/1.30 % ------ iProver source info
% 4.10/1.30
% 4.10/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.10/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.10/1.30 % git: non_committed_changes: false
% 4.10/1.30
% 4.10/1.30 % ------ Parsing...% successful
% 4.10/1.30
% 4.10/1.30
% 4.10/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.10/1.30
% 4.10/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 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: 26 0s sf_e pe_s pe_e %
% 4.10/1.30
% 4.10/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.10/1.30
% 4.10/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.10/1.30 % ------ Proving...
% 4.10/1.30 % ------ Problem Properties
% 4.10/1.30
% 4.10/1.30 %
% 4.10/1.30 % clauses 36
% 4.10/1.30 % conjectures 6
% 4.10/1.30 % EPR 9
% 4.10/1.30 % Horn 33
% 4.10/1.30 % unary 17
% 4.10/1.30 % binary 13
% 4.10/1.30 % lits 62
% 4.10/1.30 % lits eq 12
% 4.10/1.30 % fd_pure 0
% 4.10/1.30 % fd_pseudo 0
% 4.10/1.30 % fd_cond 2
% 4.10/1.30 % fd_pseudo_cond 6
% 4.10/1.30 % AC symbols 0
% 4.10/1.30
% 4.10/1.30 % ------ Schedule dynamic 5 is on
% 4.10/1.30
% 4.10/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.10/1.30
% 4.10/1.30
% 4.10/1.30 % ------
% 4.10/1.30 % Current options:
% 4.10/1.30 % ------
% 4.10/1.30
% 4.10/1.30
% 4.10/1.30 %
% 4.10/1.30
% 4.10/1.30 % ------ Proving...
% 4.10/1.30 %
% 4.10/1.30
% 4.10/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.10/1.30
% 4.10/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.10/1.30
% 4.10/1.30
%------------------------------------------------------------------------------