%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET050-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 : n007.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:15 PM UTC 2026
% Result : Unsatisfiable 4.22s 1.32s
% Output : CNFRefutation 4.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 14 unt; 0 def)
% Number of atoms : 32 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 13 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 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-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 11 :)
% 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(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(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( member(X0,X2)
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
fof(f101,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_unordered_pair_1) ).
fof(f102,negated_conjecture,
~ member(x,unordered_pair(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_unordered_pair_2) ).
fof(f103,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f105,plain,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),cross_product(u,v)),
inference(definition_unfolding,[],[f101,f103]) ).
fof(f108,plain,
! [X2,X3,X0,X1] :
( member(X0,X2)
| ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3)) ),
inference(definition_unfolding,[],[f14,f103]) ).
tcf(c_142,negated_conjecture,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),cross_product(u,v)),
inference(cnf_transformation,[],[f105]) ).
tcf(c_143,negated_conjecture,
~ member(x,unordered_pair(x,y)),
inference(cnf_transformation,[],[f102]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( member(X0,X2)
| ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3)) ),
inference(cnf_transformation,[],[f108]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_155,plain,
! [X0: $i] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f4]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subclass(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_1044,plain,
~ member(x,universal_class),
inference(superposition,[status(thm)],[c_149,c_143]) ).
tcf(c_1304,plain,
member(x,u),
inference(superposition,[status(thm)],[c_142,c_146]) ).
tcf(c_1341,plain,
! [X0: $i] :
( member(x,X0)
| ~ subclass(u,X0) ),
inference(superposition,[status(thm)],[c_1304,c_164]) ).
tcf(c_1360,plain,
member(x,universal_class),
inference(superposition,[status(thm)],[c_155,c_1341]) ).
tcf(c_1362,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1360,c_1044]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET050-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.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 09:24:23 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.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.45 % Proving...
% 4.22/1.32 % SZS status Started for theBenchmark.p
% 4.22/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 4.22/1.32
% 4.22/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.22/1.32
% 4.22/1.32 % ------ iProver source info
% 4.22/1.32
% 4.22/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 4.22/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.22/1.32 % git: non_committed_changes: false
% 4.22/1.32
% 4.22/1.32 % ------ Parsing...% successful
% 4.22/1.32
% 4.22/1.32
% 4.22/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.22/1.32
% 4.22/1.32 % ------ 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: 1 0s sf_e pe_s pe_e %
% 4.22/1.32
% 4.22/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.22/1.32
% 4.22/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.22/1.32 % ------ Proving...
% 4.22/1.32 % ------ Problem Properties
% 4.22/1.32
% 4.22/1.32 %
% 4.22/1.32 % clauses 23
% 4.22/1.32 % conjectures 2
% 4.22/1.32 % EPR 4
% 4.22/1.32 % Horn 21
% 4.22/1.32 % unary 7
% 4.22/1.32 % binary 8
% 4.22/1.32 % lits 48
% 4.22/1.32 % lits eq 6
% 4.22/1.32 % fd_pure 0
% 4.22/1.32 % fd_pseudo 0
% 4.22/1.32 % fd_cond 0
% 4.22/1.32 % fd_pseudo_cond 2
% 4.22/1.32 % AC symbols 0
% 4.22/1.32
% 4.22/1.32 % ------ Schedule dynamic 5 is on
% 4.22/1.32
% 4.22/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.22/1.32
% 4.22/1.32
% 4.22/1.32 % ------
% 4.22/1.32 % Current options:
% 4.22/1.32 % ------
% 4.22/1.32
% 4.22/1.32
% 4.22/1.32 %
% 4.22/1.32
% 4.22/1.32 % ------ Proving...
% 4.22/1.32 %
% 4.22/1.32
% 4.22/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 4.22/1.32
% 4.22/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.22/1.32
% 4.22/1.32
%------------------------------------------------------------------------------