%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET131-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 : n016.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:42 PM UTC 2026
% Result : Unsatisfiable 6.12s 1.76s
% Output : CNFRefutation 6.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 43 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 20 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f21,axiom,
! [X2,X0,X1] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(u,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_triple2_1) ).
fof(f103,negated_conjecture,
~ member(u,set_builder(x,set_builder(u,set_builder(z,null_class)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_triple2_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(u,complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))),
inference(definition_unfolding,[],[f103,f109,f109,f109]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_161,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f21]) ).
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(u,universal_class),
inference(cnf_transformation,[],[f102]) ).
tcf(c_219,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))),
inference(cnf_transformation,[],[f153]) ).
tcf(c_3432,plain,
( member(u,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))
| ~ member(u,universal_class) ),
inference(superposition,[status(thm)],[c_165,c_219]) ).
tcf(c_3670,plain,
member(u,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),
inference(global_subsumption_just,[status(thm)],[c_3432,c_218,c_3432]) ).
tcf(c_3673,plain,
member(u,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))),
inference(superposition,[status(thm)],[c_3670,c_162]) ).
tcf(c_3711,plain,
~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))),
inference(superposition,[status(thm)],[c_3673,c_164]) ).
tcf(c_3743,plain,
( member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))
| ~ member(u,universal_class) ),
inference(superposition,[status(thm)],[c_165,c_3711]) ).
tcf(c_3944,plain,
member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))),
inference(global_subsumption_just,[status(thm)],[c_3743,c_218,c_3743]) ).
tcf(c_3950,plain,
member(u,complement(unordered_pair(u,u))),
inference(superposition,[status(thm)],[c_3944,c_161]) ).
tcf(c_3959,plain,
~ member(u,unordered_pair(u,u)),
inference(superposition,[status(thm)],[c_3950,c_164]) ).
tcf(c_4054,plain,
~ member(u,universal_class),
inference(superposition,[status(thm)],[c_151,c_3959]) ).
tcf(c_4056,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4054,c_218]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET131-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.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 10:02:57 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 6.12/1.76 % SZS status Started for theBenchmark.p
% 6.12/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 6.12/1.76
% 6.12/1.76 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.12/1.76
% 6.12/1.76 % ------ iProver source info
% 6.12/1.76
% 6.12/1.76 % git: date: 2026-07-19 20:42:38 +0200
% 6.12/1.76 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.12/1.76 % git: non_committed_changes: false
% 6.12/1.76
% 6.12/1.76 % ------ Parsing...% successful
% 6.12/1.76
% 6.12/1.76
% 6.12/1.76 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.12/1.76
% 6.12/1.76 % ------ 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 %
% 6.12/1.76
% 6.12/1.76 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.12/1.76
% 6.12/1.76 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.12/1.76 % ------ Proving...
% 6.12/1.76 % ------ Problem Properties
% 6.12/1.76
% 6.12/1.76 %
% 6.12/1.76 % clauses 69
% 6.12/1.76 % conjectures 2
% 6.12/1.76 % EPR 13
% 6.12/1.76 % Horn 61
% 6.12/1.76 % unary 17
% 6.12/1.76 % binary 32
% 6.12/1.76 % lits 147
% 6.12/1.76 % lits eq 20
% 6.12/1.76 % fd_pure 0
% 6.12/1.76 % fd_pseudo 0
% 6.12/1.76 % fd_cond 3
% 6.12/1.76 % fd_pseudo_cond 3
% 6.12/1.76 % AC symbols 0
% 6.12/1.76
% 6.12/1.76 % ------ Input Options Time Limit: Unbounded
% 6.12/1.76
% 6.12/1.76
% 6.12/1.76 % ------
% 6.12/1.76 % Current options:
% 6.12/1.76 % ------
% 6.12/1.76
% 6.12/1.76
% 6.12/1.76 %
% 6.12/1.76
% 6.12/1.76 % ------ Proving...
% 6.12/1.76 %
% 6.12/1.76
% 6.12/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 6.12/1.76
% 6.12/1.76 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.12/1.76
% 6.12/1.76
%------------------------------------------------------------------------------