%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET016-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n019.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:03 PM UTC 2026
% Result : Unsatisfiable 0.60s 1.37s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 15 unt; 0 def)
% Number of atoms : 35 ( 21 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 9 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : member(X0,singleton_set(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_1) ).
fof(f2,axiom,
! [X0,X1] :
( X0 = X1
| ~ member(X0,singleton_set(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_2) ).
fof(f3,axiom,
! [X0,X1] : member(X0,unordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_1) ).
fof(f5,axiom,
! [X2,X0,X1] :
( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_3) ).
fof(f6,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton_set(X0),unordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).
fof(f7,axiom,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_ordered_pairs) ).
fof(f8,negated_conjecture,
m1 != m2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_first_components_equal) ).
fof(f9,plain,
unordered_pair(singleton_set(m1),unordered_pair(m1,r1)) = unordered_pair(singleton_set(m2),unordered_pair(m2,r2)),
inference(definition_unfolding,[],[f7,f6,f6]) ).
tcf(c_57,plain,
! [X0: $i] : member(X0,singleton_set(X0)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ member(X0,singleton_set(X1)) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : member(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_62,plain,
unordered_pair(singleton_set(m1),unordered_pair(m1,r1)) = unordered_pair(singleton_set(m2),unordered_pair(m2,r2)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_63,negated_conjecture,
m1 != m2,
inference(cnf_transformation,[],[f8]) ).
tcf(c_64,plain,
member(m1,singleton_set(m1)),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_177,negated_conjecture,
m1 != m2,
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_289,plain,
member(singleton_set(m2),unordered_pair(singleton_set(m1),unordered_pair(m1,r1))),
inference(superposition,[status(thm)],[c_62,c_59]) ).
tcf(c_296,plain,
( ( singleton_set(m1) = singleton_set(m2) )
| ( unordered_pair(m1,r1) = singleton_set(m2) ) ),
inference(superposition,[status(thm)],[c_289,c_61]) ).
tcf(c_303,plain,
( member(m1,singleton_set(m2))
| ( singleton_set(m1) = singleton_set(m2) ) ),
inference(superposition,[status(thm)],[c_296,c_59]) ).
tcf(c_325,plain,
( ( m1 = m2 )
| ( singleton_set(m1) = singleton_set(m2) ) ),
inference(superposition,[status(thm)],[c_303,c_58]) ).
tcf(c_326,plain,
singleton_set(m1) = singleton_set(m2),
inference(forward_subsumption_resolution,[status(thm)],[c_325,c_177]) ).
tcf(c_330,plain,
! [X0: $i] :
( ( X0 = m2 )
| ~ member(X0,singleton_set(m1)) ),
inference(superposition,[status(thm)],[c_326,c_58]) ).
tcf(c_333,plain,
( ( m1 = m2 )
| ~ member(m1,singleton_set(m1)) ),
inference(instantiation,[status(thm)],[c_330]) ).
tcf(c_334,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_333,c_63,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET016-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.42 % Computer : n019.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Thu Sep 24 09:08:04 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.48 Running first-order theorem proving
% 0.17/0.48 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.49
% 0.24/0.49 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.49
% 0.24/0.50 % Detected problem language: tptp
% 0.24/0.51 % Proving...
% 0.60/1.37 % SZS status Started for theBenchmark.p
% 0.60/1.37 % SZS status Unsatisfiable for theBenchmark.p
% 0.60/1.37
% 0.60/1.37 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.60/1.37
% 0.60/1.37 % ------ iProver source info
% 0.60/1.37
% 0.60/1.37 % git: date: 2026-07-19 20:42:38 +0200
% 0.60/1.37 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.60/1.37 % git: non_committed_changes: false
% 0.60/1.37
% 0.60/1.37 % ------ Parsing...% successful
% 0.60/1.37
% 0.60/1.37
% 0.60/1.37 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.60/1.37
% 0.60/1.37 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.60/1.37
% 0.60/1.37 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.60/1.37
% 0.60/1.37 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.60/1.37 % ------ Proving...
% 0.60/1.37 % ------ Problem Properties
% 0.60/1.37
% 0.60/1.37 %
% 0.60/1.37 % clauses 7
% 0.60/1.37 % conjectures 1
% 0.60/1.37 % EPR 1
% 0.60/1.37 % Horn 6
% 0.60/1.37 % unary 5
% 0.60/1.37 % binary 1
% 0.60/1.37 % lits 10
% 0.60/1.37 % lits eq 5
% 0.60/1.37 % fd_pure 0
% 0.60/1.37 % fd_pseudo 0
% 0.60/1.37 % fd_cond 0
% 0.60/1.37 % fd_pseudo_cond 2
% 0.60/1.37 % AC symbols 0
% 0.60/1.37
% 0.60/1.37 % ------ Schedule dynamic 5 is on
% 0.60/1.37
% 0.60/1.37 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.60/1.37
% 0.60/1.37
% 0.60/1.37 % ------
% 0.60/1.37 % Current options:
% 0.60/1.37 % ------
% 0.60/1.37
% 0.60/1.37
% 0.60/1.37 %
% 0.60/1.37
% 0.60/1.37 % ------ Proving...
% 0.60/1.37 %
% 0.60/1.37
% 0.60/1.37 % SZS status Unsatisfiable for theBenchmark.p
% 0.60/1.37
% 0.60/1.37 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.60/1.37
% 0.60/1.37
%------------------------------------------------------------------------------