%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG073+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 : 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 12:53:21 PM UTC 2026
% Result : Theorem 1.42s 1.29s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 58 ( 21 unt; 0 def)
% Number of atoms : 190 ( 69 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 216 ( 84 ~; 75 |; 35 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 78 !; 4 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> sorti1(op1(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
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] :
( op1(X0,X1) != X0
& op1(X1,X1) = X0
& op1(X0,X0) = X1
& sorti1(X1) )
& sorti1(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ? [X0] :
( ? [X1] :
( op2(X0,X1) != X0
& op2(X1,X1) = X0
& op2(X0,X0) = X1
& sorti2(X1) )
& 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,
! [X0] :
( ~ sorti1(X0)
| ! [X1] :
( ~ sorti1(X1)
| sorti1(op1(X0,X1)) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0] :
( ~ sorti2(X0)
| ! [X1] :
( ~ sorti2(X1)
| sorti2(op2(X0,X1)) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0] :
( ! [X1] :
( op2(X0,X1) = X0
| op2(X1,X1) != X0
| op2(X0,X0) != X1
| ~ sorti2(X1) )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f10,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(f11,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,[],[f10]) ).
fof(f12,plain,
( sK0 != op1(sK0,sK1)
& sK0 = op1(sK1,sK1)
& sK1 = op1(sK0,sK0)
& sorti1(sK1)
& sorti1(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f3]) ).
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,[],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( ~ sorti1(X0)
| ~ sorti1(X1)
| sorti1(op1(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X0,X1] :
( ~ sorti2(X0)
| ~ sorti2(X1)
| sorti2(op2(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
sK0 != op1(sK0,sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
sK0 = op1(sK1,sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
sK1 = op1(sK0,sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
! [X0,X1] :
( op2(X0,X1) = X0
| op2(X1,X1) != X0
| op2(X0,X0) != X1
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
! [X6] :
( ~ sorti1(X6)
| sorti2(h(X6)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
! [X5] :
( ~ sorti1(X5)
| j(h(X5)) = X5 ),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0,X1] :
( ~ sorti1(X0)
| ~ sorti1(X1)
| h(op1(X0,X1)) = op2(h(X0),h(X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
! [X0] :
( op2(X0,op2(X0,X0)) = X0
| op2(op2(X0,X0),op2(X0,X0)) != X0
| ~ sorti2(op2(X0,X0))
| ~ sorti2(X0) ),
inference(equality_resolution,[],[f21]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_51,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f20]) ).
tcf(c_52,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f19]) ).
tcf(c_53,plain,
op1(sK0,sK0) = sK1,
inference(cnf_transformation,[],[f18]) ).
tcf(c_54,plain,
op1(sK1,sK1) = sK0,
inference(cnf_transformation,[],[f17]) ).
tcf(c_55,plain,
op1(sK0,sK1) != sK0,
inference(cnf_transformation,[],[f16]) ).
tcf(c_56,plain,
! [X0: $i] :
( ( op2(X0,op2(X0,X0)) = X0 )
| ~ sorti2(X0)
| ~ sorti2(op2(X0,X0))
| ( op2(op2(X0,X0),op2(X0,X0)) != X0 ) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_57,negated_conjecture,
! [X0: $i,X1: $i] :
( ( op2(h(X0),h(X1)) = h(op1(X0,X1)) )
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] :
( ( j(h(X0)) = X0 )
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_61,negated_conjecture,
! [X0: $i] :
( sorti2(h(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_64,plain,
( sorti2(h(sK0))
| ~ sorti1(sK0) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_187,negated_conjecture,
! [X0: $i] :
( ( j(h(X0)) = X0 )
| ~ sorti1(X0) ),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_190,negated_conjecture,
! [X0: $i,X1: $i] :
( ( op2(h(X0),h(X1)) = h(op1(X0,X1)) )
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_475,plain,
! [X0: $i] :
( ( op2(h(X0),h(sK0)) = h(op1(X0,sK0)) )
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_51,c_190]) ).
tcf(c_478,plain,
j(h(sK0)) = sK0,
inference(superposition,[status(thm)],[c_51,c_187]) ).
tcf(c_484,plain,
! [X0: $i] :
( ( op2(h(X0),h(sK1)) = h(op1(X0,sK1)) )
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_52,c_190]) ).
tcf(c_521,plain,
op2(h(sK0),h(sK0)) = h(op1(sK0,sK0)),
inference(superposition,[status(thm)],[c_51,c_475]) ).
tcf(c_524,plain,
op2(h(sK0),h(sK0)) = h(sK1),
inference(light_normalisation,[status(thm)],[c_521,c_53]) ).
tcf(c_532,plain,
op2(h(sK0),h(sK1)) = h(op1(sK0,sK1)),
inference(superposition,[status(thm)],[c_51,c_484]) ).
tcf(c_533,plain,
op2(h(sK1),h(sK1)) = h(op1(sK1,sK1)),
inference(superposition,[status(thm)],[c_52,c_484]) ).
tcf(c_535,plain,
op2(h(sK1),h(sK1)) = h(sK0),
inference(light_normalisation,[status(thm)],[c_533,c_54]) ).
tcf(c_596,plain,
! [X0: $i,X1: $i] :
( ( j(h(op1(X0,X1))) = op1(X0,X1) )
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_49,c_187]) ).
tcf(c_700,plain,
( sorti2(h(sK1))
| ~ sorti2(h(sK0)) ),
inference(superposition,[status(thm)],[c_524,c_50]) ).
tcf(c_701,plain,
( ( op2(h(sK0),op2(h(sK0),h(sK0))) = h(sK0) )
| ~ sorti2(h(sK0))
| ~ sorti2(op2(h(sK0),h(sK0)))
| ( op2(h(sK1),h(sK1)) != h(sK0) ) ),
inference(superposition,[status(thm)],[c_524,c_56]) ).
tcf(c_704,plain,
( ( op2(h(sK0),op2(h(sK0),h(sK0))) = h(sK0) )
| ~ sorti2(h(sK0))
| ~ sorti2(op2(h(sK0),h(sK0))) ),
inference(ground_joinability,[status(thm)],[c_701,c_535]) ).
tcf(c_705,plain,
( ( h(op1(sK0,sK1)) = h(sK0) )
| ~ sorti2(h(sK1))
| ~ sorti2(h(sK0)) ),
inference(light_normalisation,[status(thm)],[c_704,c_524,c_532]) ).
tcf(c_773,plain,
! [X0: $i] :
( ( j(h(op1(X0,sK1))) = op1(X0,sK1) )
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_52,c_596]) ).
tcf(c_1333,plain,
j(h(op1(sK0,sK1))) = op1(sK0,sK1),
inference(superposition,[status(thm)],[c_51,c_773]) ).
tcf(c_2193,plain,
h(op1(sK0,sK1)) = h(sK0),
inference(global_subsumption_just,[status(thm)],[c_705,c_51,c_64,c_700,c_705]) ).
tcf(c_2199,plain,
op1(sK0,sK1) = j(h(sK0)),
inference(demodulation,[status(thm)],[c_1333,c_2193]) ).
tcf(c_2202,plain,
op1(sK0,sK1) = sK0,
inference(light_normalisation,[status(thm)],[c_2199,c_478]) ).
tcf(c_2203,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2202,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG073+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 : n006.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.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 04:41:26 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.42/1.29 % SZS status Started for theBenchmark.p
% 1.42/1.29 % SZS status Theorem for theBenchmark.p
% 1.42/1.29
% 1.42/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.42/1.29
% 1.42/1.29 % ------ iProver source info
% 1.42/1.29
% 1.42/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.42/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.42/1.29 % git: non_committed_changes: false
% 1.42/1.29
% 1.42/1.29 % ------ Parsing...
% 1.42/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.42/1.29
% 1.42/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.42/1.29
% 1.42/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.42/1.29
% 1.42/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.42/1.29 % ------ Proving...
% 1.42/1.29 % ------ Problem Properties
% 1.42/1.29
% 1.42/1.29 %
% 1.42/1.29 % clauses 14
% 1.42/1.29 % conjectures 6
% 1.42/1.29 % EPR 2
% 1.42/1.29 % Horn 14
% 1.42/1.29 % unary 5
% 1.42/1.29 % binary 4
% 1.42/1.29 % lits 29
% 1.42/1.29 % lits eq 9
% 1.42/1.29 % fd_pure 0
% 1.42/1.29 % fd_pseudo 0
% 1.42/1.29 % fd_cond 0
% 1.42/1.29 % fd_pseudo_cond 0
% 1.42/1.29 % AC symbols 0
% 1.42/1.29
% 1.42/1.29 % ------ Schedule dynamic 5 is on
% 1.42/1.29
% 1.42/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.42/1.29
% 1.42/1.29
% 1.42/1.29 % ------
% 1.42/1.29 % Current options:
% 1.42/1.29 % ------
% 1.42/1.29
% 1.42/1.29
% 1.42/1.29 %
% 1.42/1.29
% 1.42/1.29 % ------ Proving...
% 1.42/1.29 %
% 1.42/1.29
% 1.42/1.29 % SZS status Theorem for theBenchmark.p
% 1.42/1.29
% 1.42/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.42/1.29
% 1.42/1.29
%------------------------------------------------------------------------------