%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG018+1 : TPTP v9.3.1. Released v2.7.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 12:53:10 PM UTC 2026
% Result : Theorem 4.33s 1.27s
% Output : CNFRefutation 4.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 52 ( 12 unt; 0 def)
% Number of atoms : 165 ( 46 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 185 ( 72 ~; 62 |; 29 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 78 !; 4 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( sorti2(X0)
=> ! [X1] :
( sorti2(X1)
=> sorti2(op2(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
fof(f3,axiom,
? [X0] :
( ! [X1] :
( sorti1(X1)
=> op1(X1,X1) = X0 )
& sorti1(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ? [X0] :
( ! [X1] :
( sorti2(X1)
=> op2(X1,X1) = X0 )
& sorti2(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f5,conjecture,
( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f6,negated_conjecture,
~ ( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
( ! [X1] :
( ~ sorti2(X1)
| sorti1(j(X1)) )
& ! [X0] :
( ~ sorti1(X0)
| sorti2(h(X0)) )
& ! [X7] :
( ~ sorti1(X7)
| j(h(X7)) = X7 )
& ! [X6] :
( ~ sorti2(X6)
| h(j(X6)) = X6 )
& ! [X4] :
( ~ sorti2(X4)
| ! [X5] :
( ~ sorti2(X5)
| j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( ~ sorti1(X2)
| ! [X3] :
( ~ sorti1(X3)
| h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f8,plain,
( ! [X1] :
( ~ sorti2(X1)
| sorti1(j(X1)) )
& ! [X0] :
( ~ sorti1(X0)
| sorti2(h(X0)) )
& ! [X7] :
( ~ sorti1(X7)
| j(h(X7)) = X7 )
& ! [X6] :
( ~ sorti2(X6)
| h(j(X6)) = X6 )
& ! [X4] :
( ~ sorti2(X4)
| ! [X5] :
( ~ sorti2(X5)
| j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( ~ sorti1(X2)
| ! [X3] :
( ~ sorti1(X3)
| h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0] :
( ? [X1] :
( sorti2(X1)
& op2(X1,X1) != X0 )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f10,plain,
? [X0] :
( ! [X1] :
( ~ sorti1(X1)
| op1(X1,X1) = X0 )
& sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f12,plain,
! [X0] :
( ~ sorti2(X0)
| ! [X1] :
( ~ sorti2(X1)
| sorti2(op2(X0,X1)) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f13,plain,
( ! [X7] :
( ~ sorti2(X7)
| sorti1(j(X7)) )
& ! [X6] :
( ~ sorti1(X6)
| sorti2(h(X6)) )
& ! [X5] :
( ~ sorti1(X5)
| j(h(X5)) = X5 )
& ! [X4] :
( ~ sorti2(X4)
| h(j(X4)) = X4 )
& ! [X2] :
( ~ sorti2(X2)
| ! [X3] :
( ~ sorti2(X3)
| j(op2(X2,X3)) = op1(j(X2),j(X3)) ) )
& ! [X0] :
( ~ sorti1(X0)
| ! [X1] :
( ~ sorti1(X1)
| h(op1(X0,X1)) = op2(h(X0),h(X1)) ) ) ),
inference(rectify,[],[f8]) ).
fof(f14,plain,
! [X0] :
( ( sorti2(sK0(X0))
& op2(sK0(X0),sK0(X0)) != X0 )
| ~ sorti2(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f9]) ).
fof(f15,plain,
( ! [X1] :
( ~ sorti1(X1)
| op1(X1,X1) = sK1 )
& sorti1(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f10]) ).
fof(f16,plain,
! [X7] :
( ~ sorti2(X7)
| sorti1(j(X7)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f17,plain,
! [X6] :
( ~ sorti1(X6)
| sorti2(h(X6)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X4] :
( ~ sorti2(X4)
| h(j(X4)) = X4 ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X2,X3] :
( ~ sorti2(X2)
| ~ sorti2(X3)
| j(op2(X2,X3)) = op1(j(X2),j(X3)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
! [X0] :
( sorti2(sK0(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
! [X0] :
( op2(sK0(X0),sK0(X0)) != X0
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X1] :
( ~ sorti1(X1)
| op1(X1,X1) = sK1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( ~ sorti2(X0)
| ~ sorti2(X1)
| sorti2(op2(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( ( op1(j(X0),j(X1)) = j(op2(X0,X1)) )
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( ( h(j(X0)) = X0 )
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( sorti2(h(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] :
( sorti1(j(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_55,plain,
! [X0: $i] :
( ~ sorti2(X0)
| ( op2(sK0(X0),sK0(X0)) != X0 ) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_56,plain,
! [X0: $i] :
( sorti2(sK0(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_57,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f25]) ).
tcf(c_58,plain,
! [X0: $i] :
( ( op1(X0,X0) = sK1 )
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_62,plain,
( sorti2(h(sK1))
| ~ sorti1(sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_470,plain,
! [X0: $i] :
( ( h(j(sK0(X0))) = sK0(X0) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_56,c_51]) ).
tcf(c_485,plain,
! [X0: $i] :
( ( op1(j(X0),j(X0)) = sK1 )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_54,c_58]) ).
tcf(c_533,plain,
! [X0: $i,X1: $i] :
( ( h(j(op2(X0,X1))) = op2(X0,X1) )
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_60,c_51]) ).
tcf(c_553,plain,
! [X0: $i] :
( ( h(j(sK0(h(X0)))) = sK0(h(X0)) )
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_53,c_470]) ).
tcf(c_569,plain,
! [X0: $i] :
( sorti2(sK0(h(X0)))
| ~ sorti2(h(X0)) ),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_570,plain,
( sorti2(sK0(h(sK1)))
| ~ sorti2(h(sK1)) ),
inference(instantiation,[status(thm)],[c_569]) ).
tcf(c_616,plain,
h(j(sK0(h(sK1)))) = sK0(h(sK1)),
inference(superposition,[status(thm)],[c_57,c_553]) ).
tcf(c_742,plain,
( sorti2(sK0(h(sK1)))
| ~ sorti1(j(sK0(h(sK1)))) ),
inference(superposition,[status(thm)],[c_616,c_53]) ).
tcf(c_745,plain,
sorti2(sK0(h(sK1))),
inference(global_subsumption_just,[status(thm)],[c_742,c_57,c_62,c_570]) ).
tcf(c_749,plain,
op1(j(sK0(h(sK1))),j(sK0(h(sK1)))) = sK1,
inference(superposition,[status(thm)],[c_745,c_485]) ).
tcf(c_752,plain,
! [X0: $i] :
( ( op1(j(sK0(h(sK1))),j(X0)) = j(op2(sK0(h(sK1)),X0)) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_745,c_50]) ).
tcf(c_956,plain,
! [X0: $i] :
( ( h(j(op2(sK0(h(sK1)),X0))) = op2(sK0(h(sK1)),X0) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_745,c_533]) ).
tcf(c_2093,plain,
h(j(op2(sK0(h(sK1)),sK0(h(sK1))))) = op2(sK0(h(sK1)),sK0(h(sK1))),
inference(superposition,[status(thm)],[c_745,c_956]) ).
tcf(c_2209,plain,
op1(j(sK0(h(sK1))),j(sK0(h(sK1)))) = j(op2(sK0(h(sK1)),sK0(h(sK1)))),
inference(superposition,[status(thm)],[c_745,c_752]) ).
tcf(c_2214,plain,
j(op2(sK0(h(sK1)),sK0(h(sK1)))) = sK1,
inference(light_normalisation,[status(thm)],[c_2209,c_749]) ).
tcf(c_5153,plain,
op2(sK0(h(sK1)),sK0(h(sK1))) = h(sK1),
inference(light_normalisation,[status(thm)],[c_2093,c_2214]) ).
tcf(c_5155,plain,
( sorti2(h(sK1))
| ~ sorti2(sK0(h(sK1))) ),
inference(superposition,[status(thm)],[c_5153,c_60]) ).
tcf(c_5156,plain,
~ sorti2(h(sK1)),
inference(superposition,[status(thm)],[c_5153,c_55]) ).
tcf(c_5157,plain,
~ sorti2(sK0(h(sK1))),
inference(forward_subsumption_resolution,[status(thm)],[c_5155,c_5156]) ).
tcf(c_5158,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5157,c_745]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG018+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 04:32:13 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.40 Running first-order theorem proving
% 0.10/0.40 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.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 4.33/1.27 % SZS status Started for theBenchmark.p
% 4.33/1.27 % SZS status Theorem for theBenchmark.p
% 4.33/1.27
% 4.33/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.33/1.27
% 4.33/1.27 % ------ iProver source info
% 4.33/1.27
% 4.33/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 4.33/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.33/1.27 % git: non_committed_changes: false
% 4.33/1.27
% 4.33/1.27 % ------ Parsing...
% 4.33/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.33/1.27
% 4.33/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.33/1.27
% 4.33/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.33/1.27
% 4.33/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.33/1.27 % ------ Proving...
% 4.33/1.27 % ------ Problem Properties
% 4.33/1.27
% 4.33/1.27 %
% 4.33/1.27 % clauses 12
% 4.33/1.27 % conjectures 6
% 4.33/1.27 % EPR 1
% 4.33/1.27 % Horn 12
% 4.33/1.27 % unary 1
% 4.33/1.27 % binary 7
% 4.33/1.27 % lits 27
% 4.33/1.27 % lits eq 6
% 4.33/1.27 % fd_pure 0
% 4.33/1.27 % fd_pseudo 0
% 4.33/1.27 % fd_cond 0
% 4.33/1.27 % fd_pseudo_cond 0
% 4.33/1.27 % AC symbols 0
% 4.33/1.27
% 4.33/1.27 % ------ Schedule dynamic 5 is on
% 4.33/1.27
% 4.33/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.33/1.27
% 4.33/1.27
% 4.33/1.27 % ------
% 4.33/1.27 % Current options:
% 4.33/1.27 % ------
% 4.33/1.27
% 4.33/1.27
% 4.33/1.27 %
% 4.33/1.27
% 4.33/1.27 % ------ Proving...
% 4.33/1.27 %
% 4.33/1.27
% 4.33/1.27 % SZS status Theorem for theBenchmark.p
% 4.33/1.27
% 4.33/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.33/1.27
% 4.33/1.27
%------------------------------------------------------------------------------