%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU134+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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:55:31 PM UTC 2026
% Result : Theorem 1.14s 1.28s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 3 unt; 0 def)
% Number of atoms : 52 ( 27 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 20 ~; 21 |; 3 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 4 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 24 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f13,conjecture,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f21,plain,
? [X0,X1] :
( set_difference(X0,X1) = empty_set
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
? [X0,X1] :
( ( set_difference(X0,X1) = empty_set
| subset(X0,X1) )
& ( empty_set != set_difference(X0,X1)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f25,plain,
( ( empty_set = set_difference(sK2,sK3)
| subset(sK2,sK3) )
& ( empty_set != set_difference(sK2,sK3)
| ~ subset(sK2,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( empty_set != set_difference(X0,X1)
| subset(X0,X1) )
& ( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f35,plain,
( empty_set = set_difference(sK2,sK3)
| subset(sK2,sK3) ),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
( empty_set != set_difference(sK2,sK3)
| ~ subset(sK2,sK3) ),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
! [X0,X1] :
( empty_set != set_difference(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f38,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| empty_set = set_difference(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_57,negated_conjecture,
( ~ subset(sK2,sK3)
| ( set_difference(sK2,sK3) != empty_set ) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_58,negated_conjecture,
( subset(sK2,sK3)
| ( set_difference(sK2,sK3) = empty_set ) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X0,X1) = empty_set )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ( set_difference(X0,X1) != empty_set ) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_66,plain,
( ( set_difference(sK2,sK3) = empty_set )
| subset(sK2,sK3) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
tcf(c_67,plain,
( subset(sK2,sK3)
| ( set_difference(sK2,sK3) = empty_set ) ),
inference(renaming,[status(thm)],[c_66]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X0,X1) != empty_set )
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ( set_difference(X0,X1) != empty_set ) ),
inference(renaming,[status(thm)],[c_68]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X0,X1) = empty_set )
| ~ subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_116,plain,
subset(sK2,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_67,c_69]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X0,X1) = empty_set )
| ( X1 != sK3 )
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_116,c_70]) ).
tcf(c_167,plain,
set_difference(sK2,sK3) = empty_set,
inference(unflattening,[status(thm)],[c_166]) ).
tcf(c_168,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_167,c_116,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU134+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 12:52:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.14/1.28 % SZS status Started for theBenchmark.p
% 1.14/1.28 % SZS status Theorem for theBenchmark.p
% 1.14/1.28
% 1.14/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.14/1.28
% 1.14/1.28 % ------ iProver source info
% 1.14/1.28
% 1.14/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.14/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.14/1.28 % git: non_committed_changes: false
% 1.14/1.28
% 1.14/1.28 % ------ Parsing...
% 1.14/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.14/1.28
% 1.14/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s %
% 1.14/1.28
% 1.14/1.28 % SZS status Theorem for theBenchmark.p
% 1.14/1.28
% 1.14/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.14/1.28
% 1.14/1.28
%------------------------------------------------------------------------------