%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET086+1 : TPTP v9.3.1. Bugfixed v5.4.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:46:31 PM UTC 2026
% Result : Theorem 1.57s 1.28s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 11 unt; 1 def)
% Number of atoms : 50 ( 28 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 23 ~; 14 |; 10 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 14 !; 6 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f44,conjecture,
! [X0] :
? [X1] :
( ( X1 = X0
& ~ ? [X2] :
( X0 = singleton(X2)
& member(X2,universal_class) ) )
| ( X0 = singleton(X1)
& member(X1,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_substitution) ).
fof(f45,negated_conjecture,
~ ! [X0] :
? [X1] :
( ( X1 = X0
& ~ ? [X2] :
( X0 = singleton(X2)
& member(X2,universal_class) ) )
| ( X0 = singleton(X1)
& member(X1,universal_class) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0] :
! [X1] :
( ( X0 != X1
| ? [X2] :
( X0 = singleton(X2)
& member(X2,universal_class) ) )
& ( singleton(X1) != X0
| ~ member(X1,universal_class) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f103,plain,
! [X1] :
( ( sK6 != X1
| ( sK6 = singleton(sK7)
& member(sK7,universal_class) ) )
& ( singleton(X1) != sK6
| ~ member(X1,universal_class) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X2,sK7)],[f60]) ).
fof(f116,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f191,plain,
! [X1] :
( sK6 != X1
| sK6 = singleton(sK7) ),
inference(cnf_transformation,[],[f103]) ).
fof(f192,plain,
! [X1] :
( sK6 != X1
| member(sK7,universal_class) ),
inference(cnf_transformation,[],[f103]) ).
fof(f193,plain,
! [X1] :
( singleton(X1) != sK6
| ~ member(X1,universal_class) ),
inference(cnf_transformation,[],[f103]) ).
fof(f231,plain,
! [X1] :
( sK6 != unordered_pair(X1,X1)
| ~ member(X1,universal_class) ),
inference(definition_unfolding,[],[f193,f116]) ).
fof(f232,plain,
! [X1] :
( sK6 != X1
| sK6 = unordered_pair(sK7,sK7) ),
inference(definition_unfolding,[],[f191,f116]) ).
fof(f239,plain,
member(sK7,universal_class),
inference(equality_resolution,[],[f192]) ).
fof(f240,plain,
sK6 = unordered_pair(sK7,sK7),
inference(equality_resolution,[],[f232]) ).
tcf(c_128,negated_conjecture,
! [X0: $i] :
( ~ member(X0,universal_class)
| ( unordered_pair(X0,X0) != sK6 ) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_129,negated_conjecture,
member(sK7,universal_class),
inference(cnf_transformation,[],[f239]) ).
tcf(c_130,negated_conjecture,
unordered_pair(sK7,sK7) = sK6,
inference(cnf_transformation,[],[f240]) ).
tcf(c_1575,definition,
iPr_def_10 = unordered_pair(sK7,sK7),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1576,negated_conjecture,
iPr_def_10 = sK6,
inference(demodulation,[status(thm)],[c_130,c_1575]) ).
tcf(c_1577,negated_conjecture,
member(sK7,universal_class),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_1578,negated_conjecture,
! [X0: $i] :
( ~ member(X0,universal_class)
| ( unordered_pair(X0,X0) != sK6 ) ),
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_2396,plain,
! [X0: $i] :
( ~ member(X0,universal_class)
| ( unordered_pair(X0,X0) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_1578,c_1576]) ).
tcf(c_2399,plain,
~ member(sK7,universal_class),
inference(superposition,[status(thm)],[c_1575,c_2396]) ).
tcf(c_2400,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2399,c_1577]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET086+1 : TPTP v9.3.1. Bugfixed v5.4.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 09:40: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.57/1.28 % SZS status Started for theBenchmark.p
% 1.57/1.28 % SZS status Theorem for theBenchmark.p
% 1.57/1.28
% 1.57/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.57/1.28
% 1.57/1.28 % ------ iProver source info
% 1.57/1.28
% 1.57/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.57/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.57/1.28 % git: non_committed_changes: false
% 1.57/1.28
% 1.57/1.28 % ------ Parsing...
% 1.57/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.57/1.28
% 1.57/1.28 % ------ 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: 4 0s sf_e pe_s pe_e %
% 1.57/1.28
% 1.57/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.57/1.28
% 1.57/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.57/1.28 % ------ Proving...
% 1.57/1.28 % ------ Problem Properties
% 1.57/1.28
% 1.57/1.28 %
% 1.57/1.28 % clauses 78
% 1.57/1.28 % conjectures 3
% 1.57/1.28 % EPR 9
% 1.57/1.28 % Horn 70
% 1.57/1.28 % unary 17
% 1.57/1.28 % binary 40
% 1.57/1.28 % lits 161
% 1.57/1.28 % lits eq 17
% 1.57/1.28 % fd_pure 0
% 1.57/1.28 % fd_pseudo 0
% 1.57/1.28 % fd_cond 4
% 1.57/1.28 % fd_pseudo_cond 3
% 1.57/1.28 % AC symbols 0
% 1.57/1.28
% 1.57/1.28 % ------ Schedule dynamic 5 is on
% 1.57/1.28
% 1.57/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.57/1.28
% 1.57/1.28
% 1.57/1.28 % ------
% 1.57/1.28 % Current options:
% 1.57/1.28 % ------
% 1.57/1.28
% 1.57/1.28
% 1.57/1.28 %
% 1.57/1.28
% 1.57/1.28 % ------ Proving...
% 1.57/1.28 %
% 1.57/1.28
% 1.57/1.28 % SZS status Theorem for theBenchmark.p
% 1.57/1.28
% 1.57/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.57/1.28
% 1.57/1.28
%------------------------------------------------------------------------------