%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET125-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.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:46:41 PM UTC 2026
% Result : Unsatisfiable 1.40s 1.29s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 36 ( 23 unt; 5 def)
% Number of atoms : 73 ( 9 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 40 ( 22 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f22,axiom,
! [X2,X0,X1] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
fof(f25,axiom,
! [X0,X1] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
fof(f26,axiom,
! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
fof(f101,axiom,
! [X0,X1] : union(singleton(X0),X1) = set_builder(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_of_set_builder) ).
fof(f102,negated_conjecture,
member(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_set_builder_alternate_defn3_1) ).
fof(f103,negated_conjecture,
~ member(x,set_builder(y,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_set_builder_alternate_defn3_2) ).
fof(f109,plain,
! [X0,X1] : set_builder(X0,X1) = complement(intersection(complement(unordered_pair(X0,X0)),complement(X1))),
inference(definition_unfolding,[],[f101,f26,f12]) ).
fof(f153,plain,
~ member(x,complement(intersection(complement(unordered_pair(y,y)),complement(z)))),
inference(definition_unfolding,[],[f103,f109]) ).
tcf(c_143,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subclass(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_146,plain,
! [X0: $i] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f4]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_218,negated_conjecture,
member(x,z),
inference(cnf_transformation,[],[f102]) ).
tcf(c_219,negated_conjecture,
~ member(x,complement(intersection(complement(unordered_pair(y,y)),complement(z)))),
inference(cnf_transformation,[],[f153]) ).
tcf(c_2645,definition,
iPr_def_10 = unordered_pair(y,y),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2646,definition,
iPr_def_11 = complement(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2647,definition,
iPr_def_12 = complement(z),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_2648,definition,
iPr_def_13 = intersection(iPr_def_11,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_2649,definition,
iPr_def_14 = complement(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_2650,negated_conjecture,
~ member(x,iPr_def_14),
inference(demodulation,[status(thm)],[c_219,c_2647,c_2645,c_2646,c_2648,c_2649]) ).
tcf(c_2651,negated_conjecture,
member(x,z),
inference(demodulation,[status(thm)],[c_218]) ).
tcf(c_3526,plain,
! [X0: $i] :
( member(X0,iPr_def_12)
| ~ member(X0,iPr_def_13) ),
inference(superposition,[status(thm)],[c_2648,c_162]) ).
tcf(c_3570,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_12)
| ~ member(X0,z) ),
inference(superposition,[status(thm)],[c_2647,c_164]) ).
tcf(c_3606,plain,
! [X0: $i] :
( member(x,X0)
| ~ subclass(z,X0) ),
inference(superposition,[status(thm)],[c_2651,c_143]) ).
tcf(c_3674,plain,
member(x,universal_class),
inference(superposition,[status(thm)],[c_146,c_3606]) ).
tcf(c_3763,plain,
! [X0: $i] :
( member(X0,iPr_def_14)
| member(X0,iPr_def_13)
| ~ member(X0,universal_class) ),
inference(superposition,[status(thm)],[c_2649,c_165]) ).
tcf(c_4673,plain,
( member(x,iPr_def_14)
| member(x,iPr_def_13) ),
inference(superposition,[status(thm)],[c_3674,c_3763]) ).
tcf(c_4674,plain,
member(x,iPr_def_13),
inference(forward_subsumption_resolution,[status(thm)],[c_4673,c_2650]) ).
tcf(c_4802,plain,
member(x,iPr_def_12),
inference(superposition,[status(thm)],[c_4674,c_3526]) ).
tcf(c_4807,plain,
~ member(x,z),
inference(superposition,[status(thm)],[c_4802,c_3570]) ).
tcf(c_4808,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4807,c_2651]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET125-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n018.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 09:59:34 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 1.40/1.29 % SZS status Started for theBenchmark.p
% 1.40/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.40/1.29
% 1.40/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.40/1.29
% 1.40/1.29 % ------ iProver source info
% 1.40/1.29
% 1.40/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.40/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.40/1.29 % git: non_committed_changes: false
% 1.40/1.29
% 1.40/1.29 % ------ Parsing...% successful
% 1.40/1.29
% 1.40/1.29
% 1.40/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.40/1.29
% 1.40/1.29 % ------ 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: 2 0s sf_e pe_s pe_e %
% 1.40/1.29
% 1.40/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.40/1.29
% 1.40/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.40/1.29 % ------ Proving...
% 1.40/1.29 % ------ Problem Properties
% 1.40/1.29
% 1.40/1.29 %
% 1.40/1.29 % clauses 74
% 1.40/1.29 % conjectures 2
% 1.40/1.29 % EPR 14
% 1.40/1.29 % Horn 66
% 1.40/1.29 % unary 22
% 1.40/1.29 % binary 32
% 1.40/1.29 % lits 152
% 1.40/1.29 % lits eq 25
% 1.40/1.29 % fd_pure 0
% 1.40/1.29 % fd_pseudo 0
% 1.40/1.29 % fd_cond 3
% 1.40/1.29 % fd_pseudo_cond 3
% 1.40/1.29 % AC symbols 0
% 1.40/1.29
% 1.40/1.29 % ------ Schedule dynamic 5 is on
% 1.40/1.29
% 1.40/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.40/1.29
% 1.40/1.29
% 1.40/1.29 % ------
% 1.40/1.29 % Current options:
% 1.40/1.29 % ------
% 1.40/1.29
% 1.40/1.29
% 1.40/1.29 %
% 1.40/1.29
% 1.40/1.29 % ------ Proving...
% 1.40/1.29 %
% 1.40/1.29
% 1.40/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.40/1.29
% 1.40/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.40/1.30
% 1.40/1.30
%------------------------------------------------------------------------------