%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET019+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n018.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:06 PM UTC 2026
% Result : Theorem 1.18s 1.26s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 46 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 12 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 18 !; 4 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f12,conjecture,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI02) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f16,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f19,plain,
? [X0,X1] :
( subset(X1,X0)
& subset(X0,X1)
& ~ equal_set(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
? [X0,X1] :
( subset(X1,X0)
& subset(X0,X1)
& ~ equal_set(X0,X1) ),
inference(flattening,[],[f19]) ).
fof(f40,plain,
( subset(sK4,sK3)
& subset(sK3,sK4)
& ~ equal_set(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f20]) ).
fof(f44,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f68,plain,
subset(sK4,sK3),
inference(cnf_transformation,[],[f40]) ).
fof(f69,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f40]) ).
fof(f70,plain,
~ equal_set(sK3,sK4),
inference(cnf_transformation,[],[f40]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_76,negated_conjecture,
~ equal_set(sK3,sK4),
inference(cnf_transformation,[],[f70]) ).
tcf(c_77,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f69]) ).
tcf(c_78,negated_conjecture,
subset(sK4,sK3),
inference(cnf_transformation,[],[f68]) ).
tcf(c_434,plain,
! [X0: $i,X1: $i] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| ( X1 != sK4 )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_76]) ).
tcf(c_435,plain,
( ~ subset(sK4,sK3)
| ~ subset(sK3,sK4) ),
inference(unflattening,[status(thm)],[c_434]) ).
tcf(c_436,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_435,c_77,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET019+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 09:14:18 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 1.18/1.26 % SZS status Started for theBenchmark.p
% 1.18/1.26 % SZS status Theorem for theBenchmark.p
% 1.18/1.26
% 1.18/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.18/1.26
% 1.18/1.26 % ------ iProver source info
% 1.18/1.26
% 1.18/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.18/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.18/1.26 % git: non_committed_changes: false
% 1.18/1.26
% 1.18/1.26 % ------ Parsing...
% 1.18/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.18/1.26
% 1.18/1.26 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s %
% 1.18/1.26
% 1.18/1.26 % SZS status Theorem for theBenchmark.p
% 1.18/1.26
% 1.18/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.18/1.26
% 1.18/1.26
%------------------------------------------------------------------------------