%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT001-4 : 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 : 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 01:01:01 PM UTC 2026
% Result : Unsatisfiable 2.28s 6.21s
% Output : CNFRefutation 2.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X2,X0,X1] : compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',associativity_of_compose) ).
fof(f13,axiom,
! [X2,X0,X1] :
( X0 = X2
| compose(compose(a,b),X2) != X1
| compose(compose(a,b),X0) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monomorphism) ).
fof(f15,axiom,
compose(b,h) = compose(b,g),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bh_equals_bg) ).
fof(f16,negated_conjecture,
h != g,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_h_equals_g) ).
fof(f18,plain,
! [X2,X0] :
( X0 = X2
| compose(compose(a,b),X0) != compose(compose(a,b),X2) ),
inference(equality_resolution,[],[f13]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] : compose(compose(X0,X1),X2) = compose(X0,compose(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( compose(compose(a,b),X0) != compose(compose(a,b),X1) ) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_79,plain,
compose(b,h) = compose(b,g),
inference(cnf_transformation,[],[f15]) ).
tcf(c_80,negated_conjecture,
h != g,
inference(cnf_transformation,[],[f16]) ).
tcf(c_177,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( compose(a,compose(b,X0)) != compose(a,compose(b,X1)) ) ),
inference(demodulation,[status(thm)],[c_77,c_73]) ).
tcf(c_263,negated_conjecture,
h != g,
inference(demodulation,[status(thm)],[c_80]) ).
tcf(c_424,plain,
! [X0: $i] :
( ( X0 = g )
| ( compose(a,compose(b,X0)) != compose(a,compose(b,h)) ) ),
inference(superposition,[status(thm)],[c_79,c_177]) ).
tcf(c_539,plain,
h = g,
inference(equality_resolution,[status(thm)],[c_424]) ).
tcf(c_540,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_539,c_263]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT001-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/5.40 % Computer : n015.cluster.edu
% 0.02/5.40 % Model : x86_64 x86_64
% 0.02/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/5.40 % Memory : 8046.5625MB
% 0.02/5.40 % OS : Linux 6.8.0-71-generic
% 0.02/5.40 % CPULimit : 300
% 0.02/5.40 % WCLimit : 300
% 0.02/5.40 % DateTime : Fri Sep 25 06:53:48 UTC 2026
% 0.02/5.40 % CPUTime :
% 0.02/5.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/5.44 Running first-order theorem proving
% 0.02/5.44 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.02/5.45
% 0.02/5.45 % ======== iProver multi-core TPTP/SMT =========
% 0.02/5.45
% 0.02/5.45 % Detected problem language: tptp
% 0.02/5.46 % Proving...
% 2.28/6.21 % SZS status Started for theBenchmark.p
% 2.28/6.21 % SZS status Unsatisfiable for theBenchmark.p
% 2.28/6.21
% 2.28/6.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.28/6.21
% 2.28/6.21 % ------ iProver source info
% 2.28/6.21
% 2.28/6.21 % git: date: 2026-07-19 20:42:38 +0200
% 2.28/6.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.28/6.21 % git: non_committed_changes: false
% 2.28/6.21
% 2.28/6.21 % ------ Parsing...% successful
% 2.28/6.21
% 2.28/6.21
% 2.28/6.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.28/6.21
% 2.28/6.21 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.28/6.21
% 2.28/6.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.28/6.21
% 2.28/6.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.28/6.21 % ------ Proving...
% 2.28/6.21 % ------ Problem Properties
% 2.28/6.21
% 2.28/6.21 %
% 2.28/6.21 % clauses 13
% 2.28/6.21 % conjectures 1
% 2.28/6.21 % EPR 1
% 2.28/6.21 % Horn 13
% 2.28/6.21 % unary 7
% 2.28/6.21 % binary 5
% 2.28/6.21 % lits 20
% 2.28/6.21 % lits eq 9
% 2.28/6.21 % fd_pure 0
% 2.28/6.21 % fd_pseudo 0
% 2.28/6.21 % fd_cond 0
% 2.28/6.21 % fd_pseudo_cond 1
% 2.28/6.21 % AC symbols 0
% 2.28/6.21
% 2.28/6.21 % ------ Schedule dynamic 5 is on
% 2.28/6.21
% 2.28/6.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.28/6.21
% 2.28/6.21
% 2.28/6.21 % ------
% 2.28/6.21 % Current options:
% 2.28/6.21 % ------
% 2.28/6.21
% 2.28/6.21
% 2.28/6.21 %
% 2.28/6.21
% 2.28/6.21 % ------ Proving...
% 2.28/6.21 %
% 2.28/6.21
% 2.28/6.21 % SZS status Unsatisfiable for theBenchmark.p
% 2.28/6.21
% 2.28/6.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.28/6.21
% 2.28/6.21
%------------------------------------------------------------------------------