%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET079-6 : 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 : n004.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:29 PM UTC 2026
% Result : Unsatisfiable 3.71s 1.18s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 14 unt; 1 def)
% Number of atoms : 56 ( 19 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 27 ( 12 ~; 15 |; 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f21,axiom,
! [X2,X0,X1] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
fof(f69,axiom,
! [X0] :
( intersection(X0,regular(X0)) = null_class
| X0 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
fof(f70,plain,
! [X0] :
( null_class = intersection(X0,regular(X0))
| null_class = X0 ),
inference(reorient_equations,[],[f69]) ).
fof(f101,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_set_in_its_singleton_1) ).
fof(f102,negated_conjecture,
singleton(x) = null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_set_in_its_singleton_2) ).
fof(f103,plain,
null_class = singleton(x),
inference(reorient_equations,[],[f102]) ).
fof(f152,plain,
null_class = unordered_pair(x,x),
inference(definition_unfolding,[],[f103,f12]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_160,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_195,plain,
! [X0: $i] :
( ( X0 = null_class )
| ( intersection(X0,regular(X0)) = null_class ) ),
inference(cnf_transformation,[],[f70]) ).
tcf(c_217,negated_conjecture,
member(x,universal_class),
inference(cnf_transformation,[],[f101]) ).
tcf(c_218,negated_conjecture,
unordered_pair(x,x) = null_class,
inference(cnf_transformation,[],[f152]) ).
tcf(c_2644,definition,
iPr_def_10 = unordered_pair(x,x),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2645,negated_conjecture,
iPr_def_10 = null_class,
inference(demodulation,[status(thm)],[c_218,c_2644]) ).
tcf(c_2646,negated_conjecture,
member(x,universal_class),
inference(demodulation,[status(thm)],[c_217]) ).
tcf(c_3435,plain,
( member(x,iPr_def_10)
| ~ member(x,universal_class) ),
inference(superposition,[status(thm)],[c_2644,c_150]) ).
tcf(c_3436,plain,
member(x,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_3435,c_2646]) ).
tcf(c_3437,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ( intersection(X0,regular(X0)) = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_195,c_2645]) ).
tcf(c_3455,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| ( X1 = iPr_def_10 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_3437,c_160]) ).
tcf(c_3533,plain,
! [X0: $i] :
( member(x,X0)
| ( X0 = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_3436,c_3455]) ).
tcf(c_3546,plain,
! [X0: $i] :
( ( complement(X0) = iPr_def_10 )
| ~ member(x,X0) ),
inference(superposition,[status(thm)],[c_3533,c_163]) ).
tcf(c_4007,plain,
complement(iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_3436,c_3546]) ).
tcf(c_4150,plain,
! [X0: $i] : ~ member(X0,iPr_def_10),
inference(superposition,[status(thm)],[c_4007,c_163]) ).
tcf(c_4152,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_3436,c_4150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET079-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n004.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 09:38:20 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 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.39
% 0.12/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.39
% 0.12/0.39 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.71/1.18 % SZS status Started for theBenchmark.p
% 3.71/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.71/1.18
% 3.71/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.71/1.18
% 3.71/1.18 % ------ iProver source info
% 3.71/1.18
% 3.71/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.71/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.71/1.18 % git: non_committed_changes: false
% 3.71/1.18
% 3.71/1.18 % ------ Parsing...% successful
% 3.71/1.18
% 3.71/1.18
% 3.71/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.71/1.18
% 3.71/1.18 % ------ 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 %
% 3.71/1.18
% 3.71/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.71/1.18
% 3.71/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.71/1.18 % ------ Proving...
% 3.71/1.18 % ------ Problem Properties
% 3.71/1.18
% 3.71/1.18 %
% 3.71/1.18 % clauses 70
% 3.71/1.18 % conjectures 2
% 3.71/1.18 % EPR 14
% 3.71/1.18 % Horn 62
% 3.71/1.18 % unary 18
% 3.71/1.18 % binary 32
% 3.71/1.18 % lits 148
% 3.71/1.18 % lits eq 22
% 3.71/1.18 % fd_pure 0
% 3.71/1.18 % fd_pseudo 0
% 3.71/1.18 % fd_cond 3
% 3.71/1.18 % fd_pseudo_cond 3
% 3.71/1.18 % AC symbols 0
% 3.71/1.18
% 3.71/1.18 % ------ Schedule dynamic 5 is on
% 3.71/1.18
% 3.71/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.71/1.18
% 3.71/1.18
% 3.71/1.18 % ------
% 3.71/1.18 % Current options:
% 3.71/1.18 % ------
% 3.71/1.18
% 3.71/1.18
% 3.71/1.18 %
% 3.71/1.18
% 3.71/1.18 % ------ Proving...
% 3.71/1.18 %
% 3.71/1.18
% 3.71/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.71/1.18
% 3.71/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.71/1.18
% 3.71/1.18
%------------------------------------------------------------------------------