%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET038-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:12 PM UTC 2026
% Result : Unsatisfiable 18.11s 3.30s
% Output : CNFRefutation 18.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 51 ( 12 unt; 0 def)
% Number of atoms : 121 ( 13 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 142 ( 72 ~; 70 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn 78 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( little_set(X0)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',a2) ).
fof(f15,axiom,
! [X2,X0,X1] :
( X0 != ordered_pair(X1,X2)
| ~ little_set(X2)
| ~ little_set(X1)
| ordered_pair_predicate(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate4) ).
fof(f16,plain,
! [X2,X0,X1] :
( ordered_pair(X1,X2) != X0
| ~ little_set(X2)
| ~ little_set(X1)
| ordered_pair_predicate(X0) ),
inference(reorient_equations,[],[f15]) ).
fof(f79,axiom,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',subset1) ).
fof(f123,axiom,
! [X2,X0,X1] :
( X0 != second(X2)
| ~ member(X2,X1)
| ~ ordered_pair_predicate(X2)
| ~ little_set(X0)
| member(X0,range_of(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',range_of4) ).
fof(f124,plain,
! [X2,X0,X1] :
( second(X2) != X0
| ~ member(X2,X1)
| ~ ordered_pair_predicate(X2)
| ~ little_set(X0)
| member(X0,range_of(X1)) ),
inference(reorient_equations,[],[f123]) ).
fof(f138,axiom,
! [X2,X0,X1] :
( function(X0)
| ~ maps(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',maps1) ).
fof(f139,axiom,
! [X2,X0,X1] :
( domain_of(X0) = X1
| ~ maps(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',maps2) ).
fof(f140,axiom,
! [X2,X0,X1] :
( subset(range_of(X0),X2)
| ~ maps(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',maps3) ).
fof(f168,axiom,
! [X0,X1] :
( second(ordered_pair(X0,X1)) = X1
| ~ little_set(X1)
| ~ little_set(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_second) ).
fof(f170,axiom,
! [X0] :
( little_set(second(X0))
| ~ ordered_pair_predicate(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',second_component_is_small) ).
fof(f177,axiom,
! [X0,X1] :
( little_set(apply(X0,X1))
| ~ function(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',function_values_are_small) ).
fof(f184,axiom,
! [X2,X0,X1] :
( member(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2
| ~ member(X1,domain_of(X0))
| ~ function(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apply_for_functions2) ).
fof(f185,axiom,
maps(a_function,a_domain,a_range),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_mapping) ).
fof(f186,axiom,
member(a,a_domain),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_domain) ).
fof(f187,negated_conjecture,
~ member(apply(a_function,a),a_range),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mapping_in_range) ).
fof(f191,plain,
! [X0,X1] :
( member(ordered_pair(X1,apply(X0,X1)),X0)
| ~ member(X1,domain_of(X0))
| ~ function(X0) ),
inference(equality_resolution,[],[f184]) ).
fof(f193,plain,
! [X2,X1] :
( ~ member(X2,X1)
| ~ ordered_pair_predicate(X2)
| ~ little_set(second(X2))
| member(second(X2),range_of(X1)) ),
inference(equality_resolution,[],[f124]) ).
fof(f196,plain,
! [X2,X1] :
( ~ little_set(X2)
| ~ little_set(X1)
| ordered_pair_predicate(ordered_pair(X1,X2)) ),
inference(equality_resolution,[],[f16]) ).
tcf(c_215,plain,
maps(a_function,a_domain,a_range),
inference(cnf_transformation,[],[f185]) ).
tcf(c_216,plain,
member(a,a_domain),
inference(cnf_transformation,[],[f186]) ).
tcf(c_217,negated_conjecture,
~ member(apply(a_function,a),a_range),
inference(cnf_transformation,[],[f187]) ).
tcf(c_220,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(range_of(X0),X2)
| ~ maps(X0,X1,X2) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_221,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( domain_of(X0) = X1 )
| ~ maps(X0,X1,X2) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_222,plain,
! [X0: $i,X1: $i,X2: $i] :
( function(X0)
| ~ maps(X0,X1,X2) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_224,plain,
! [X0: $i,X1: $i] :
( little_set(apply(X0,X1))
| ~ function(X0) ),
inference(cnf_transformation,[],[f177]) ).
tcf(c_232,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f79]) ).
tcf(c_233,plain,
! [X0: $i,X1: $i] :
( member(ordered_pair(X0,apply(X1,X0)),X1)
| ~ function(X1)
| ~ member(X0,domain_of(X1)) ),
inference(cnf_transformation,[],[f191]) ).
tcf(c_235,plain,
! [X0: $i,X1: $i] :
( member(second(X0),range_of(X1))
| ~ ordered_pair_predicate(X0)
| ~ little_set(second(X0))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_236,plain,
! [X0: $i,X1: $i] :
( little_set(X0)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_238,plain,
! [X0: $i,X1: $i] :
( ( second(ordered_pair(X0,X1)) = X1 )
| ~ little_set(X1)
| ~ little_set(X0) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_244,plain,
! [X0: $i,X1: $i] :
( ordered_pair_predicate(ordered_pair(X0,X1))
| ~ little_set(X1)
| ~ little_set(X0) ),
inference(cnf_transformation,[],[f196]) ).
tcf(c_246,plain,
! [X0: $i] :
( little_set(second(X0))
| ~ ordered_pair_predicate(X0) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_275,plain,
! [X0: $i,X1: $i] :
( member(second(X0),range_of(X1))
| ~ ordered_pair_predicate(X0)
| ~ member(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_235,c_246,c_235]) ).
tcf(c_1302,plain,
little_set(a),
inference(superposition,[status(thm)],[c_216,c_236]) ).
tcf(c_1325,plain,
function(a_function),
inference(superposition,[status(thm)],[c_215,c_222]) ).
tcf(c_1334,plain,
subset(range_of(a_function),a_range),
inference(superposition,[status(thm)],[c_215,c_220]) ).
tcf(c_1339,plain,
domain_of(a_function) = a_domain,
inference(superposition,[status(thm)],[c_215,c_221]) ).
tcf(c_1382,plain,
! [X0: $i] :
( member(X0,a_range)
| ~ member(X0,range_of(a_function)) ),
inference(superposition,[status(thm)],[c_1334,c_232]) ).
tcf(c_1447,plain,
! [X0: $i] :
( member(second(X0),a_range)
| ~ ordered_pair_predicate(X0)
| ~ member(X0,a_function) ),
inference(superposition,[status(thm)],[c_275,c_1382]) ).
tcf(c_1559,plain,
! [X0: $i] :
( ( second(ordered_pair(a,X0)) = X0 )
| ~ little_set(X0) ),
inference(superposition,[status(thm)],[c_1302,c_238]) ).
tcf(c_1585,plain,
! [X0: $i,X1: $i] :
( ( second(ordered_pair(a,apply(X0,X1))) = apply(X0,X1) )
| ~ function(X0) ),
inference(superposition,[status(thm)],[c_224,c_1559]) ).
tcf(c_1885,plain,
! [X0: $i] :
( ordered_pair_predicate(ordered_pair(a,X0))
| ~ little_set(a)
| ~ little_set(X0) ),
inference(instantiation,[status(thm)],[c_244]) ).
tcf(c_1998,plain,
! [X0: $i] :
( little_set(apply(a_function,X0))
| ~ function(a_function) ),
inference(instantiation,[status(thm)],[c_224]) ).
tcf(c_2359,plain,
! [X0: $i] : second(ordered_pair(a,apply(a_function,X0))) = apply(a_function,X0),
inference(superposition,[status(thm)],[c_1325,c_1585]) ).
tcf(c_2463,plain,
! [X0: $i] :
( member(apply(a_function,X0),a_range)
| ~ ordered_pair_predicate(ordered_pair(a,apply(a_function,X0)))
| ~ member(ordered_pair(a,apply(a_function,X0)),a_function) ),
inference(superposition,[status(thm)],[c_2359,c_1447]) ).
tcf(c_2982,plain,
! [X0: $i] :
( ordered_pair_predicate(ordered_pair(a,apply(a_function,X0)))
| ~ little_set(a)
| ~ little_set(apply(a_function,X0)) ),
inference(instantiation,[status(thm)],[c_1885]) ).
tcf(c_35404,plain,
! [X0: $i] :
( member(apply(a_function,X0),a_range)
| ~ member(ordered_pair(a,apply(a_function,X0)),a_function) ),
inference(global_subsumption_just,[status(thm)],[c_2463,c_1302,c_1325,c_1998,c_2463,c_2982]) ).
tcf(c_35411,plain,
( member(apply(a_function,a),a_range)
| ~ function(a_function)
| ~ member(a,domain_of(a_function)) ),
inference(superposition,[status(thm)],[c_233,c_35404]) ).
tcf(c_35412,plain,
( member(apply(a_function,a),a_range)
| ~ function(a_function)
| ~ member(a,a_domain) ),
inference(light_normalisation,[status(thm)],[c_35411,c_1339]) ).
tcf(c_35413,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_35412,c_217,c_1325,c_216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET038-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 09:25:56 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 18.11/3.30 % SZS status Started for theBenchmark.p
% 18.11/3.30 % SZS status Unsatisfiable for theBenchmark.p
% 18.11/3.30
% 18.11/3.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 18.11/3.30
% 18.11/3.30 % ------ iProver source info
% 18.11/3.30
% 18.11/3.30 % git: date: 2026-07-19 20:42:38 +0200
% 18.11/3.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 18.11/3.30 % git: non_committed_changes: false
% 18.11/3.30
% 18.11/3.30 % ------ Parsing...% successful
% 18.11/3.30
% 18.11/3.30
% 18.11/3.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 18.11/3.30
% 18.11/3.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 18.11/3.30
% 18.11/3.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 18.11/3.30
% 18.11/3.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 18.11/3.30 % ------ Proving...
% 18.11/3.30 % ------ Problem Properties
% 18.11/3.30
% 18.11/3.30 %
% 18.11/3.30 % clauses 33
% 18.11/3.30 % conjectures 1
% 18.11/3.30 % EPR 8
% 18.11/3.30 % Horn 33
% 18.11/3.30 % unary 5
% 18.11/3.30 % binary 9
% 18.11/3.30 % lits 92
% 18.11/3.30 % lits eq 10
% 18.11/3.30 % fd_pure 0
% 18.11/3.30 % fd_pseudo 0
% 18.11/3.30 % fd_cond 0
% 18.11/3.30 % fd_pseudo_cond 5
% 18.11/3.30 % AC symbols 0
% 18.11/3.30
% 18.11/3.30 % ------ Schedule dynamic 5 is on
% 18.11/3.30
% 18.11/3.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 18.11/3.30
% 18.11/3.30
% 18.11/3.30 % ------
% 18.11/3.30 % Current options:
% 18.11/3.30 % ------
% 18.11/3.30
% 18.11/3.30
% 18.11/3.30 %
% 18.11/3.30
% 18.11/3.30 % ------ Proving...
% 18.11/3.30 %
% 18.11/3.30
% 18.11/3.30 % SZS status Unsatisfiable for theBenchmark.p
% 18.11/3.30
% 18.11/3.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 18.11/3.30
% 18.11/3.30
%------------------------------------------------------------------------------