%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET558-6 : 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 : n006.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:47:24 PM UTC 2026
% Result : Unsatisfiable 3.51s 1.29s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 17 unt; 3 def)
% Number of atoms : 40 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f84,axiom,
! [X0] :
( cross_product(domain_of(domain_of(X0)),domain_of(domain_of(X0))) = domain_of(X0)
| ~ operation(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',operation2) ).
fof(f85,plain,
! [X0] :
( domain_of(X0) = cross_product(domain_of(domain_of(X0)),domain_of(domain_of(X0)))
| ~ operation(X0) ),
inference(reorient_equations,[],[f84]) ).
fof(f90,axiom,
! [X2,X0,X1] :
( domain_of(domain_of(X1)) = domain_of(X0)
| ~ compatible(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',compatible2) ).
fof(f91,plain,
! [X2,X0,X1] :
( domain_of(X0) = domain_of(domain_of(X1))
| ~ compatible(X0,X1,X2) ),
inference(reorient_equations,[],[f90]) ).
fof(f122,negated_conjecture,
operation(xf1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_functions_alternate_defn1_1) ).
fof(f123,negated_conjecture,
compatible(xh,xf1,xf2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_functions_alternate_defn1_2) ).
fof(f124,negated_conjecture,
cross_product(domain_of(xh),domain_of(xh)) != domain_of(xf1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_compatible_functions_alternate_defn1_3) ).
tcf(c_226,plain,
! [X0: $i] :
( ( cross_product(domain_of(domain_of(X0)),domain_of(domain_of(X0))) = domain_of(X0) )
| ~ operation(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_230,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( domain_of(domain_of(X1)) = domain_of(X0) )
| ~ compatible(X0,X1,X2) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_257,negated_conjecture,
operation(xf1),
inference(cnf_transformation,[],[f122]) ).
tcf(c_258,negated_conjecture,
compatible(xh,xf1,xf2),
inference(cnf_transformation,[],[f123]) ).
tcf(c_259,negated_conjecture,
cross_product(domain_of(xh),domain_of(xh)) != domain_of(xf1),
inference(cnf_transformation,[],[f124]) ).
tcf(c_3092,definition,
iPr_def_10 = domain_of(xh),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_3093,definition,
iPr_def_11 = cross_product(iPr_def_10,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_3094,definition,
iPr_def_12 = domain_of(xf1),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_3095,negated_conjecture,
iPr_def_11 != iPr_def_12,
inference(demodulation,[status(thm)],[c_259,c_3094,c_3092,c_3093]) ).
tcf(c_3096,negated_conjecture,
compatible(xh,xf1,xf2),
inference(demodulation,[status(thm)],[c_258]) ).
tcf(c_3097,negated_conjecture,
operation(xf1),
inference(demodulation,[status(thm)],[c_257]) ).
tcf(c_4361,plain,
domain_of(domain_of(xf1)) = domain_of(xh),
inference(superposition,[status(thm)],[c_3096,c_230]) ).
tcf(c_4362,plain,
domain_of(iPr_def_12) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_4361,c_3092,c_3094]) ).
tcf(c_4408,plain,
cross_product(domain_of(domain_of(xf1)),domain_of(domain_of(xf1))) = domain_of(xf1),
inference(superposition,[status(thm)],[c_3097,c_226]) ).
tcf(c_4409,plain,
iPr_def_11 = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_4408,c_3093,c_3094,c_4362]) ).
tcf(c_4410,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4409,c_3095]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET558-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n006.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 11:17:26 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 3.51/1.29 % SZS status Started for theBenchmark.p
% 3.51/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.51/1.29
% 3.51/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.51/1.29
% 3.51/1.29 % ------ iProver source info
% 3.51/1.29
% 3.51/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.51/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.51/1.29 % git: non_committed_changes: false
% 3.51/1.29
% 3.51/1.29 % ------ Parsing...% successful
% 3.51/1.29
% 3.51/1.29
% 3.51/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.51/1.29
% 3.51/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.51/1.29
% 3.51/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.51/1.29
% 3.51/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.51/1.29 % ------ Proving...
% 3.51/1.29 % ------ Problem Properties
% 3.51/1.29
% 3.51/1.29 %
% 3.51/1.29 % clauses 87
% 3.51/1.29 % conjectures 3
% 3.51/1.29 % EPR 15
% 3.51/1.29 % Horn 79
% 3.51/1.29 % unary 26
% 3.51/1.29 % binary 40
% 3.51/1.29 % lits 175
% 3.51/1.29 % lits eq 29
% 3.51/1.29 % fd_pure 0
% 3.51/1.29 % fd_pseudo 0
% 3.51/1.29 % fd_cond 3
% 3.51/1.29 % fd_pseudo_cond 7
% 3.51/1.29 % AC symbols 0
% 3.51/1.29
% 3.51/1.29 % ------ Schedule dynamic 5 is on
% 3.51/1.29
% 3.51/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.51/1.29
% 3.51/1.29
% 3.51/1.29 % ------
% 3.51/1.29 % Current options:
% 3.51/1.29 % ------
% 3.51/1.29
% 3.51/1.29
% 3.51/1.29 %
% 3.51/1.29
% 3.51/1.29 % ------ Proving...
% 3.51/1.29 %
% 3.51/1.29
% 3.51/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.51/1.29
% 3.51/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.51/1.29
% 3.51/1.29
%------------------------------------------------------------------------------