%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET012-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n003.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:00 PM UTC 2026
% Result : Unsatisfiable 2.71s 1.30s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 9 unt; 2 def)
% Number of atoms : 71 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 42 ( 21 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 28 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( member(member_of_1_not_of_2(X0,X1),X0)
| subset(X0,X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
fof(f5,axiom,
! [X0,X1] :
( member(X0,complement(X1))
| member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',member_of_set_or_complement) ).
fof(f6,axiom,
! [X0,X1] :
( ~ member(X0,complement(X1))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',not_member_of_set_and_complement) ).
fof(f15,axiom,
! [X0,X1] :
( equal_sets(X1,X0)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_are_set_equal_sets) ).
fof(f22,negated_conjecture,
~ equal_sets(complement(complement(a)),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_involution) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(member_of_1_not_of_2(X0,X1),X1) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( equal_sets(X1,X0)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_92,negated_conjecture,
~ equal_sets(complement(complement(a)),a),
inference(cnf_transformation,[],[f22]) ).
tcf(c_420,definition,
iPr_def_10 = complement(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_421,definition,
iPr_def_11 = complement(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_422,negated_conjecture,
~ equal_sets(iPr_def_11,a),
inference(demodulation,[status(thm)],[c_92,c_420,c_421]) ).
tcf(c_823,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| member(X0,a) ),
inference(superposition,[status(thm)],[c_420,c_75]) ).
tcf(c_824,plain,
! [X0: $i] :
( member(X0,iPr_def_11)
| member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_421,c_75]) ).
tcf(c_867,plain,
! [X0: $i] :
( subset(X0,a)
| member(member_of_1_not_of_2(X0,a),iPr_def_10) ),
inference(superposition,[status(thm)],[c_823,c_74]) ).
tcf(c_868,plain,
! [X0: $i] :
( subset(X0,iPr_def_11)
| member(member_of_1_not_of_2(X0,iPr_def_11),iPr_def_10) ),
inference(superposition,[status(thm)],[c_824,c_74]) ).
tcf(c_891,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_10)
| ~ member(X0,a) ),
inference(superposition,[status(thm)],[c_420,c_76]) ).
tcf(c_892,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_11)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_421,c_76]) ).
tcf(c_908,plain,
! [X0: $i] :
( subset(X0,iPr_def_11)
| ~ member(member_of_1_not_of_2(X0,iPr_def_11),a) ),
inference(superposition,[status(thm)],[c_868,c_891]) ).
tcf(c_922,plain,
! [X0: $i] :
( subset(X0,a)
| ~ member(member_of_1_not_of_2(X0,a),iPr_def_11) ),
inference(superposition,[status(thm)],[c_867,c_892]) ).
tcf(c_1078,plain,
subset(a,iPr_def_11),
inference(superposition,[status(thm)],[c_73,c_908]) ).
tcf(c_1080,plain,
( equal_sets(iPr_def_11,a)
| ~ subset(iPr_def_11,a) ),
inference(superposition,[status(thm)],[c_1078,c_85]) ).
tcf(c_1081,plain,
~ subset(iPr_def_11,a),
inference(forward_subsumption_resolution,[status(thm)],[c_1080,c_422]) ).
tcf(c_1095,plain,
subset(iPr_def_11,a),
inference(superposition,[status(thm)],[c_73,c_922]) ).
tcf(c_1097,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1095,c_1081]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET012-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n003.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 09:06:22 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 2.71/1.30 % SZS status Started for theBenchmark.p
% 2.71/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.71/1.30
% 2.71/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.71/1.30
% 2.71/1.30 % ------ iProver source info
% 2.71/1.30
% 2.71/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.71/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.71/1.30 % git: non_committed_changes: false
% 2.71/1.30
% 2.71/1.30 % ------ Parsing...% successful
% 2.71/1.30
% 2.71/1.30
% 2.71/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.71/1.30
% 2.71/1.30 % ------ Preprocessing... sf_s rm: 3 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.71/1.30
% 2.71/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.71/1.30
% 2.71/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.71/1.30 % ------ Proving...
% 2.71/1.30 % ------ Problem Properties
% 2.71/1.30
% 2.71/1.30 %
% 2.71/1.30 % clauses 21
% 2.71/1.30 % conjectures 1
% 2.71/1.30 % EPR 9
% 2.71/1.30 % Horn 18
% 2.71/1.30 % unary 5
% 2.71/1.30 % binary 11
% 2.71/1.30 % lits 42
% 2.71/1.30 % lits eq 2
% 2.71/1.30 % fd_pure 0
% 2.71/1.30 % fd_pseudo 0
% 2.71/1.30 % fd_cond 0
% 2.71/1.30 % fd_pseudo_cond 0
% 2.71/1.30 % AC symbols 0
% 2.71/1.30
% 2.71/1.30 % ------ Schedule dynamic 5 is on
% 2.71/1.30
% 2.71/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.71/1.30
% 2.71/1.30
% 2.71/1.30 % ------
% 2.71/1.30 % Current options:
% 2.71/1.30 % ------
% 2.71/1.30
% 2.71/1.30
% 2.71/1.30 %
% 2.71/1.30
% 2.71/1.30 % ------ Proving...
% 2.71/1.30 %
% 2.71/1.30
% 2.71/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.71/1.30
% 2.71/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.71/1.30
% 2.71/1.30
%------------------------------------------------------------------------------