%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM141-1 : 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 : n011.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:23:24 PM UTC 2026
% Result : Unsatisfiable 4.30s 1.28s
% Output : CNFRefutation 4.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 23 ( 14 unt; 0 def)
% Number of atoms : 34 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 16 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 9 :)
% 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(f22,axiom,
! [X2,X0,X1] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
fof(f25,axiom,
! [X0,X1] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
fof(f26,axiom,
! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
fof(f44,axiom,
! [X0] : union(X0,singleton(X0)) = successor(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',successor) ).
fof(f176,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_successor_of_set_is_set2_1) ).
fof(f177,negated_conjecture,
~ member(x,successor(x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_successor_of_set_is_set2_2) ).
fof(f183,plain,
! [X0] : successor(X0) = complement(intersection(complement(X0),complement(unordered_pair(X0,X0)))),
inference(definition_unfolding,[],[f44,f26,f12]) ).
fof(f268,plain,
~ member(x,complement(intersection(complement(x),complement(unordered_pair(x,x))))),
inference(definition_unfolding,[],[f177,f183]) ).
tcf(c_217,plain,
! [X0: $i,X1: $i] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_228,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_230,plain,
! [X0: $i,X1: $i] :
( ~ member(X0,X1)
| ~ member(X0,complement(X1)) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_231,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_344,negated_conjecture,
member(x,universal_class),
inference(cnf_transformation,[],[f176]) ).
tcf(c_345,negated_conjecture,
~ member(x,complement(intersection(complement(x),complement(unordered_pair(x,x))))),
inference(cnf_transformation,[],[f268]) ).
tcf(c_404,plain,
( member(x,intersection(complement(x),complement(unordered_pair(x,x))))
| ~ member(x,universal_class) ),
inference(superposition,[status(thm)],[c_231,c_345]) ).
tcf(c_459,plain,
member(x,intersection(complement(x),complement(unordered_pair(x,x)))),
inference(global_subsumption_just,[status(thm)],[c_404,c_344,c_404]) ).
tcf(c_462,plain,
member(x,complement(unordered_pair(x,x))),
inference(superposition,[status(thm)],[c_459,c_228]) ).
tcf(c_576,plain,
~ member(x,unordered_pair(x,x)),
inference(superposition,[status(thm)],[c_462,c_230]) ).
tcf(c_938,plain,
~ member(x,universal_class),
inference(superposition,[status(thm)],[c_217,c_576]) ).
tcf(c_940,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_344,c_938]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM141-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n011.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 03:01:28 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...
% 4.30/1.28 % SZS status Started for theBenchmark.p
% 4.30/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 4.30/1.28
% 4.30/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.30/1.28
% 4.30/1.28 % ------ iProver source info
% 4.30/1.28
% 4.30/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.30/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.30/1.28 % git: non_committed_changes: false
% 4.30/1.28
% 4.30/1.28 % ------ Parsing...% successful
% 4.30/1.28
% 4.30/1.28
% 4.30/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.30/1.28 % ------ Proving...
% 4.30/1.28 % ------ Problem Properties
% 4.30/1.28
% 4.30/1.28 %
% 4.30/1.28 % clauses 137
% 4.30/1.28 % conjectures 2
% 4.30/1.28 % EPR 21
% 4.30/1.28 % Horn 125
% 4.30/1.28 % unary 27
% 4.30/1.28 % binary 76
% 4.30/1.28 % lits 295
% 4.30/1.28 % lits eq 42
% 4.30/1.28 % fd_pure 0
% 4.30/1.28 % fd_pseudo 0
% 4.30/1.28 % fd_cond 5
% 4.30/1.28 % fd_pseudo_cond 11
% 4.30/1.28 % AC symbols 0
% 4.30/1.28
% 4.30/1.28 % ------ Input Options Time Limit: Unbounded
% 4.30/1.28
% 4.30/1.28
% 4.30/1.28 % ------
% 4.30/1.28 % Current options:
% 4.30/1.28 % ------
% 4.30/1.28
% 4.30/1.28
% 4.30/1.28 %
% 4.30/1.28
% 4.30/1.28 % ------ Proving...
% 4.30/1.28 %
% 4.30/1.28
% 4.30/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 4.30/1.28
% 4.30/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.30/1.28
% 4.30/1.28
%------------------------------------------------------------------------------