%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG201+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 : n017.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:46 PM UTC 2026
% Result : Theorem 2.28s 1.28s
% Output : CNFRefutation 2.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 112 ( 37 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 134 ( 50 ~; 39 |; 25 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 55 !; 1 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( sorti1(X0)
=> op1(X0,X0) != X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ! [X0] :
( sorti2(X0)
=> op2(X0,X0) != 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(f9,plain,
! [X0] :
( ~ sorti1(X0)
| op1(X0,X0) != X0 ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,plain,
? [X0] :
( sorti2(X0)
& op2(X0,X0) = X0 ),
inference(ennf_transformation,[],[f4]) ).
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(ennf_transformation,[],[f6]) ).
fof(f12,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,[],[f11]) ).
fof(f13,plain,
( sorti2(sK0)
& sK0 = op2(sK0,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10]) ).
fof(f14,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,[],[f12]) ).
fof(f17,plain,
! [X0] :
( ~ sorti1(X0)
| op1(X0,X0) != X0 ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
sK0 = op2(sK0,sK0),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X7] :
( ~ sorti2(X7)
| sorti1(j(X7)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X2,X3] :
( ~ sorti2(X2)
| ~ sorti2(X3)
| j(op2(X2,X3)) = op1(j(X2),j(X3)) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_51,plain,
! [X0: $i] :
( ~ sorti1(X0)
| ( op1(X0,X0) != X0 ) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_52,plain,
op2(sK0,sK0) = sK0,
inference(cnf_transformation,[],[f19]) ).
tcf(c_53,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f18]) ).
tcf(c_55,negated_conjecture,
! [X0: $i,X1: $i] :
( ( op1(j(X0),j(X1)) = j(op2(X0,X1)) )
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_59,negated_conjecture,
! [X0: $i] :
( sorti1(j(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_60,plain,
( sorti1(j(sK0))
| ~ sorti2(sK0) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_172,negated_conjecture,
! [X0: $i,X1: $i] :
( ( op1(j(X0),j(X1)) = j(op2(X0,X1)) )
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(demodulation,[status(thm)],[c_55]) ).
tcf(c_438,plain,
! [X0: $i] :
( ( op1(j(X0),j(sK0)) = j(op2(X0,sK0)) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_53,c_172]) ).
tcf(c_533,plain,
op1(j(sK0),j(sK0)) = j(op2(sK0,sK0)),
inference(superposition,[status(thm)],[c_53,c_438]) ).
tcf(c_535,plain,
op1(j(sK0),j(sK0)) = j(sK0),
inference(light_normalisation,[status(thm)],[c_533,c_52]) ).
tcf(c_578,plain,
! [X0: $i] :
( ~ sorti1(j(X0))
| ( op1(j(X0),j(X0)) != j(X0) ) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_579,plain,
( ~ sorti1(j(sK0))
| ( op1(j(sK0),j(sK0)) != j(sK0) ) ),
inference(instantiation,[status(thm)],[c_578]) ).
tcf(c_580,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_579,c_535,c_60,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG201+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.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 04:58:17 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.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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 2.28/1.28 % SZS status Started for theBenchmark.p
% 2.28/1.28 % SZS status Theorem for theBenchmark.p
% 2.28/1.28
% 2.28/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.28/1.28
% 2.28/1.28 % ------ iProver source info
% 2.28/1.28
% 2.28/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.28/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.28/1.28 % git: non_committed_changes: false
% 2.28/1.28
% 2.28/1.28 % ------ Parsing...
% 2.28/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.28/1.28
% 2.28/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.28/1.28
% 2.28/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.28/1.28
% 2.28/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.28/1.28 % ------ Proving...
% 2.28/1.28 % ------ Problem Properties
% 2.28/1.28
% 2.28/1.28 %
% 2.28/1.28 % clauses 11
% 2.28/1.28 % conjectures 6
% 2.28/1.28 % EPR 1
% 2.28/1.28 % Horn 11
% 2.28/1.28 % unary 2
% 2.28/1.28 % binary 5
% 2.28/1.28 % lits 24
% 2.28/1.28 % lits eq 6
% 2.28/1.28 % fd_pure 0
% 2.28/1.28 % fd_pseudo 0
% 2.28/1.28 % fd_cond 0
% 2.28/1.28 % fd_pseudo_cond 0
% 2.28/1.28 % AC symbols 0
% 2.28/1.28
% 2.28/1.28 % ------ Schedule dynamic 5 is on
% 2.28/1.28
% 2.28/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.28/1.28
% 2.28/1.28
% 2.28/1.28 % ------
% 2.28/1.28 % Current options:
% 2.28/1.28 % ------
% 2.28/1.28
% 2.28/1.28
% 2.28/1.28 %
% 2.28/1.28
% 2.28/1.28 % ------ Proving...
% 2.28/1.28 %
% 2.28/1.28
% 2.28/1.28 % SZS status Theorem for theBenchmark.p
% 2.28/1.28
% 2.28/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.28/1.28
% 2.28/1.28
%------------------------------------------------------------------------------