%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET199-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 : n002.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:55 PM UTC 2026
% Result : Unsatisfiable 3.40s 6.30s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 12 unt; 1 def)
% Number of atoms : 54 ( 1 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 39 ( 18 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f2,axiom,
! [X0,X1] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
fof(f3,axiom,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
fof(f122,negated_conjecture,
subclass(z,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_1) ).
fof(f123,negated_conjecture,
subclass(z,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_2) ).
fof(f124,negated_conjecture,
~ subclass(z,intersection(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_3) ).
tcf(c_164,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_257,negated_conjecture,
subclass(z,x),
inference(cnf_transformation,[],[f122]) ).
tcf(c_258,negated_conjecture,
subclass(z,y),
inference(cnf_transformation,[],[f123]) ).
tcf(c_259,negated_conjecture,
~ subclass(z,intersection(x,y)),
inference(cnf_transformation,[],[f124]) ).
tcf(c_2988,definition,
iPr_def_10 = intersection(x,y),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2989,negated_conjecture,
~ subclass(z,iPr_def_10),
inference(demodulation,[status(thm)],[c_259,c_2988]) ).
tcf(c_2990,negated_conjecture,
subclass(z,y),
inference(demodulation,[status(thm)],[c_258]) ).
tcf(c_2991,negated_conjecture,
subclass(z,x),
inference(demodulation,[status(thm)],[c_257]) ).
tcf(c_4017,plain,
! [X0: $i] :
( member(X0,x)
| ~ member(X0,z) ),
inference(superposition,[status(thm)],[c_2991,c_164]) ).
tcf(c_4018,plain,
! [X0: $i] :
( member(X0,y)
| ~ member(X0,z) ),
inference(superposition,[status(thm)],[c_2990,c_164]) ).
tcf(c_4102,plain,
! [X0: $i] :
( subclass(z,X0)
| member(not_subclass_element(z,X0),x) ),
inference(superposition,[status(thm)],[c_165,c_4017]) ).
tcf(c_4113,plain,
! [X0: $i] :
( subclass(z,X0)
| member(not_subclass_element(z,X0),y) ),
inference(superposition,[status(thm)],[c_165,c_4018]) ).
tcf(c_4364,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| ~ member(X0,y)
| ~ member(X0,x) ),
inference(superposition,[status(thm)],[c_2988,c_184]) ).
tcf(c_5067,plain,
! [X0: $i] :
( subclass(z,X0)
| member(not_subclass_element(z,X0),iPr_def_10)
| ~ member(not_subclass_element(z,X0),y) ),
inference(superposition,[status(thm)],[c_4102,c_4364]) ).
tcf(c_5107,plain,
! [X0: $i] :
( subclass(z,X0)
| member(not_subclass_element(z,X0),iPr_def_10) ),
inference(global_subsumption_just,[status(thm)],[c_5067,c_4113,c_5067]) ).
tcf(c_5114,plain,
subclass(z,iPr_def_10),
inference(superposition,[status(thm)],[c_5107,c_166]) ).
tcf(c_5118,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5114,c_2989]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET199-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n002.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Thu Sep 24 10:16:27 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 3.40/6.30 % SZS status Started for theBenchmark.p
% 3.40/6.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.40/6.30
% 3.40/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.40/6.30
% 3.40/6.30 % ------ iProver source info
% 3.40/6.30
% 3.40/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.40/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.40/6.30 % git: non_committed_changes: false
% 3.40/6.30
% 3.40/6.30 % ------ Parsing...% successful
% 3.40/6.30
% 3.40/6.30
% 3.40/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.40/6.30
% 3.40/6.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.40/6.30
% 3.40/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.40/6.30
% 3.40/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.40/6.30 % ------ Proving...
% 3.40/6.30 % ------ Problem Properties
% 3.40/6.30
% 3.40/6.30 %
% 3.40/6.30 % clauses 85
% 3.40/6.30 % conjectures 3
% 3.40/6.30 % EPR 15
% 3.40/6.30 % Horn 77
% 3.40/6.30 % unary 24
% 3.40/6.30 % binary 40
% 3.40/6.30 % lits 173
% 3.40/6.30 % lits eq 26
% 3.40/6.30 % fd_pure 0
% 3.40/6.30 % fd_pseudo 0
% 3.40/6.30 % fd_cond 3
% 3.40/6.30 % fd_pseudo_cond 7
% 3.40/6.30 % AC symbols 0
% 3.40/6.30
% 3.40/6.30 % ------ Schedule dynamic 5 is on
% 3.40/6.30
% 3.40/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.40/6.30
% 3.40/6.30
% 3.40/6.30 % ------
% 3.40/6.30 % Current options:
% 3.40/6.30 % ------
% 3.40/6.30
% 3.40/6.30
% 3.40/6.30 %
% 3.40/6.30
% 3.40/6.30 % ------ Proving...
% 3.40/6.30 %
% 3.40/6.30
% 3.40/6.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.40/6.30
% 3.40/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/6.30
% 3.40/6.30
%------------------------------------------------------------------------------