%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET014-2 : 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 : n026.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:02 PM UTC 2026
% Result : Unsatisfiable 1.59s 1.10s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 54 ( 24 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X2,X0,X1] :
( member(X0,X2)
| ~ subset(X1,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',membership_in_subsets) ).
fof(f3,axiom,
! [X0,X1] :
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
| ~ member(member_of_1_not_of_2(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
fof(f9,axiom,
! [X2,X0,X1] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_union_is_member_of_one_set) ).
fof(f22,axiom,
subset(as,cs),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_subset_of_c) ).
fof(f23,axiom,
subset(bs,cs),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_subset_of_c) ).
fof(f24,negated_conjecture,
~ subset(union(as,bs),cs),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_union_b_subset_of_c) ).
tcf(c_74,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(member_of_1_not_of_2(X0,X1),X1) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_94,plain,
subset(as,cs),
inference(cnf_transformation,[],[f22]) ).
tcf(c_95,plain,
subset(bs,cs),
inference(cnf_transformation,[],[f23]) ).
tcf(c_96,negated_conjecture,
~ subset(union(as,bs),cs),
inference(cnf_transformation,[],[f24]) ).
tcf(c_447,plain,
! [X0_iProver_equal_sets_1: iProver_equal_sets_1,X0_iProver_member_1: iProver_member_1,X1_iProver_equal_sets_1: iProver_equal_sets_1] :
( member(X0_iProver_member_1,X1_iProver_equal_sets_1)
| member(X0_iProver_member_1,X0_iProver_equal_sets_1)
| ~ member(X0_iProver_member_1,union(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1)) ),
inference(subtyping,[status(esa)],[c_81]) ).
tcf(c_452,plain,
! [X0_iProver_equal_sets_1: iProver_equal_sets_1,X1_iProver_equal_sets_1: iProver_equal_sets_1] :
( subset(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1)
| ~ member(member_of_1_not_of_2(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1),X1_iProver_equal_sets_1) ),
inference(subtyping,[status(esa)],[c_76]) ).
tcf(c_453,plain,
! [X0_iProver_equal_sets_1: iProver_equal_sets_1,X1_iProver_equal_sets_1: iProver_equal_sets_1] :
( subset(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1)
| member(member_of_1_not_of_2(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1),X0_iProver_equal_sets_1) ),
inference(subtyping,[status(esa)],[c_75]) ).
tcf(c_454,plain,
! [X0_iProver_equal_sets_1: iProver_equal_sets_1,X0_iProver_member_1: iProver_member_1,X1_iProver_equal_sets_1: iProver_equal_sets_1] :
( member(X0_iProver_member_1,X1_iProver_equal_sets_1)
| ~ member(X0_iProver_member_1,X0_iProver_equal_sets_1)
| ~ subset(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1) ),
inference(subtyping,[status(esa)],[c_74]) ).
tcf(c_515,plain,
( subset(union(as,bs),cs)
| member(member_of_1_not_of_2(union(as,bs),cs),union(as,bs)) ),
inference(instantiation,[status(thm)],[c_453]) ).
tcf(c_586,plain,
( member(member_of_1_not_of_2(union(as,bs),cs),bs)
| member(member_of_1_not_of_2(union(as,bs),cs),as)
| ~ member(member_of_1_not_of_2(union(as,bs),cs),union(as,bs)) ),
inference(instantiation,[status(thm)],[c_447]) ).
tcf(c_710,plain,
! [X0_iProver_equal_sets_1: iProver_equal_sets_1,X1_iProver_equal_sets_1: iProver_equal_sets_1,X2_iProver_equal_sets_1: iProver_equal_sets_1] :
( member(member_of_1_not_of_2(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1),X1_iProver_equal_sets_1)
| ~ subset(X2_iProver_equal_sets_1,X1_iProver_equal_sets_1)
| ~ member(member_of_1_not_of_2(X0_iProver_equal_sets_1,X1_iProver_equal_sets_1),X2_iProver_equal_sets_1) ),
inference(instantiation,[status(thm)],[c_454]) ).
tcf(c_1083,plain,
( subset(union(as,bs),cs)
| ~ member(member_of_1_not_of_2(union(as,bs),cs),cs) ),
inference(instantiation,[status(thm)],[c_452]) ).
tcf(c_1845,plain,
! [X0_iProver_equal_sets_1: iProver_equal_sets_1] :
( member(member_of_1_not_of_2(union(as,bs),cs),cs)
| ~ subset(X0_iProver_equal_sets_1,cs)
| ~ member(member_of_1_not_of_2(union(as,bs),cs),X0_iProver_equal_sets_1) ),
inference(instantiation,[status(thm)],[c_710]) ).
tcf(c_3637,plain,
( member(member_of_1_not_of_2(union(as,bs),cs),cs)
| ~ subset(as,cs)
| ~ member(member_of_1_not_of_2(union(as,bs),cs),as) ),
inference(instantiation,[status(thm)],[c_1845]) ).
tcf(c_4885,plain,
( member(member_of_1_not_of_2(union(as,bs),cs),cs)
| ~ subset(bs,cs)
| ~ member(member_of_1_not_of_2(union(as,bs),cs),bs) ),
inference(instantiation,[status(thm)],[c_1845]) ).
tcf(c_4887,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4885,c_3637,c_1083,c_586,c_515,c_96,c_94,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET014-2 : 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.38 % Computer : n026.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Thu Sep 24 09:09:09 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/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.09/0.43
% 0.09/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 1.59/1.10 % SZS status Started for theBenchmark.p
% 1.59/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 1.59/1.10
% 1.59/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.59/1.10
% 1.59/1.10 % ------ iProver source info
% 1.59/1.10
% 1.59/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 1.59/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.59/1.10 % git: non_committed_changes: false
% 1.59/1.10
% 1.59/1.10 % ------ Parsing...% successful
% 1.59/1.10
% 1.59/1.10
% 1.59/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.59/1.10
% 1.59/1.10 % ------ Preprocessing... sf_s rm: 3 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.59/1.10
% 1.59/1.10 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.59/1.10 % ------ Proving...
% 1.59/1.10 % ------ Problem Properties
% 1.59/1.10
% 1.59/1.10 %
% 1.59/1.10 % clauses 21
% 1.59/1.10 % conjectures 1
% 1.59/1.10 % EPR 10
% 1.59/1.10 % Horn 18
% 1.59/1.10 % unary 5
% 1.59/1.10 % binary 11
% 1.59/1.10 % lits 42
% 1.59/1.10 % lits eq 0
% 1.59/1.10 % fd_pure 0
% 1.59/1.10 % fd_pseudo 0
% 1.59/1.10 % fd_cond 0
% 1.59/1.10 % fd_pseudo_cond 0
% 1.59/1.10 % AC symbols 0
% 1.59/1.10
% 1.59/1.10 % ------ Input Options Time Limit: Unbounded
% 1.59/1.10
% 1.59/1.10
% 1.59/1.10 % ------
% 1.59/1.10 % Current options:
% 1.59/1.10 % ------
% 1.59/1.10
% 1.59/1.10
% 1.59/1.10 %
% 1.59/1.10
% 1.59/1.10 % ------ Proving...
% 1.59/1.10 %
% 1.59/1.10
% 1.59/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 1.59/1.10
% 1.59/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/1.10
% 1.59/1.10
%------------------------------------------------------------------------------