%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV693-1 : TPTP v9.3.1. Released v4.1.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 03:24:01 PM UTC 2026
% Result : Unsatisfiable 29.27s 5.82s
% Output : CNFRefutation 29.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 17 unt; 0 def)
% Number of atoms : 36 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 13 ( 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 : 23 ( 23 usr; 6 con; 0-5 aty)
% Number of variables : 43 ( 0 sgn 43 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1307,axiom,
hBOOL(hAPP(c_HOL_Oord__class_Oless(v_i,tc_nat),v_n)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_assms_0) ).
fof(f1404,axiom,
! [X2,X0,X1] :
( ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,X0),X2))
| c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(X0,tc_bool)),X0),c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,X0),tc_fun(X0,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,X0)
| ~ class_Orderings_Olinorder(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_ivl__disj__un_I3_J_0) ).
fof(f1405,plain,
! [X2,X0,X1] :
( ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,X0),X2))
| c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,X0) = c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(X0,tc_bool)),X0),c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,X0),tc_fun(X0,tc_bool))
| ~ class_Orderings_Olinorder(X0) ),
inference(reorient_equations,[],[f1404]) ).
fof(f1448,axiom,
! [X2,X3,X0,X1] : c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X0,X1,X2),X3,tc_fun(X2,tc_bool)) = c_Set_Oinsert(X0,c_Lattices_Oupper__semilattice__class_Osup(X1,X3,tc_fun(X2,tc_bool)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Un__insert__left_0) ).
fof(f1449,axiom,
! [X2,X3,X0,X1] : c_Lattices_Oupper__semilattice__class_Osup(X0,c_Set_Oinsert(X1,X2,X3),tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Oupper__semilattice__class_Osup(X0,X2,tc_fun(X3,tc_bool)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Un__insert__right_0) ).
fof(f1493,axiom,
! [X0,X1] : c_Lattices_Oupper__semilattice__class_Osup(c_Orderings_Obot__class_Obot(tc_fun(X0,tc_bool)),X1,tc_fun(X0,tc_bool)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Un__empty__left_0) ).
fof(f1573,negated_conjecture,
hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)) != hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_i,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_i,v_n,tc_nat),tc_fun(tc_nat,tc_bool))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f1617,axiom,
class_Orderings_Olinorder(tc_nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_nat__Orderings_Olinorder) ).
tcf(c_1520,negated_conjecture,
hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_i,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_i,v_n,tc_nat),tc_fun(tc_nat,tc_bool))) != hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)),
inference(cnf_transformation,[],[f1573]) ).
tcf(c_1687,plain,
hBOOL(hAPP(c_HOL_Oord__class_Oless(v_i,tc_nat),v_n)),
inference(cnf_transformation,[],[f1307]) ).
tcf(c_1723,plain,
! [X0: $i,X1: $i] : c_Lattices_Oupper__semilattice__class_Osup(c_Orderings_Obot__class_Obot(tc_fun(X0,tc_bool)),X1,tc_fun(X0,tc_bool)) = X1,
inference(cnf_transformation,[],[f1493]) ).
tcf(c_1738,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : c_Lattices_Oupper__semilattice__class_Osup(X0,c_Set_Oinsert(X1,X2,X3),tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Oupper__semilattice__class_Osup(X0,X2,tc_fun(X3,tc_bool)),X3),
inference(cnf_transformation,[],[f1449]) ).
tcf(c_1739,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X0,X1,X2),X3,tc_fun(X2,tc_bool)) = c_Set_Oinsert(X0,c_Lattices_Oupper__semilattice__class_Osup(X1,X3,tc_fun(X2,tc_bool)),X2),
inference(cnf_transformation,[],[f1448]) ).
tcf(c_1759,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X0,c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X1),c_SetInterval_Oord__class_OgreaterThanLessThan(X0,X2,X1),tc_fun(X1,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X0,X2,X1) )
| ~ class_Orderings_Olinorder(X1)
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X0,X1),X2)) ),
inference(cnf_transformation,[],[f1405]) ).
tcf(c_2067,plain,
class_Orderings_Olinorder(tc_nat),
inference(cnf_transformation,[],[f1617]) ).
tcf(c_7471,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X0,X1,X2),X3,tc_fun(X2,tc_bool)) = c_Lattices_Oupper__semilattice__class_Osup(X1,c_Set_Oinsert(X0,X3,X2),tc_fun(X2,tc_bool)),
inference(demodulation,[status(thm)],[c_1739,c_1738]) ).
tcf(c_8330,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( c_Set_Oinsert(X0,c_SetInterval_Oord__class_OgreaterThanLessThan(X0,X2,X1),X1) = c_SetInterval_Oord__class_OatLeastLessThan(X0,X2,X1) )
| ~ class_Orderings_Olinorder(X1)
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X0,X1),X2)) ),
inference(demodulation,[status(thm)],[c_1759,c_1723,c_7471]) ).
tcf(c_9606,plain,
hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_Set_Oinsert(v_i,c_SetInterval_Oord__class_OgreaterThanLessThan(v_i,v_n,tc_nat),tc_nat)) != hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)),
inference(demodulation,[status(thm)],[c_1520,c_1723,c_7471]) ).
tcf(c_10099,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( c_Set_Oinsert(X1,c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,X0),X0) = c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,X0) )
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X1,X0),X2))
| ( X0 != tc_nat ) ),
inference(resolution_lifted,[status(thm)],[c_8330,c_2067]) ).
tcf(c_10100,plain,
! [X0: $i,X1: $i] :
( ( c_Set_Oinsert(X0,c_SetInterval_Oord__class_OgreaterThanLessThan(X0,X1,tc_nat),tc_nat) = c_SetInterval_Oord__class_OatLeastLessThan(X0,X1,tc_nat) )
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X0,tc_nat),X1)) ),
inference(unflattening,[status(thm)],[c_10099]) ).
tcf(c_19436,plain,
! [X0: $i,X1: $i] :
( ( c_Set_Oinsert(X0,c_SetInterval_Oord__class_OgreaterThanLessThan(X0,X1,tc_nat),tc_nat) = c_SetInterval_Oord__class_OatLeastLessThan(X0,X1,tc_nat) )
| ~ hBOOL(hAPP(c_HOL_Oord__class_Oless(X0,tc_nat),X1)) ),
inference(prop_impl_just,[status(thm)],[c_10100]) ).
tcf(c_39311,plain,
c_Set_Oinsert(v_i,c_SetInterval_Oord__class_OgreaterThanLessThan(v_i,v_n,tc_nat),tc_nat) = c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat),
inference(superposition,[status(thm)],[c_1687,c_19436]) ).
tcf(c_39355,plain,
hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)) != hAPP(hAPP(c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex),c_COMBS(hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_Complex_Ocomplex,tc_Complex_Ocomplex),tc_nat),c_HOL_Otimes__class_Otimes(tc_Complex_Ocomplex)),hAPP(c_COMBC(hAPP(hAPP(c_COMBB(tc_fun(tc_nat,tc_Complex_Ocomplex),tc_fun(tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),tc_nat),c_Finite__Set_Osetsum(tc_nat,tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_Complex_Ocomplex,tc_fun(tc_nat,tc_Complex_Ocomplex),tc_nat),c_Power_Opower__class_Opower(tc_Complex_Ocomplex)),hAPP(hAPP(c_COMBB(tc_nat,tc_Complex_Ocomplex,tc_nat),hAPP(c_Power_Opower__class_Opower(tc_Complex_Ocomplex),c_FFT__Mirabelle_Oroot(v_n))),hAPP(c_COMBC(c_HOL_Ominus__class_Ominus(tc_nat),tc_nat,tc_nat,tc_nat),v_i)))),tc_nat,tc_fun(tc_nat,tc_bool),tc_Complex_Ocomplex),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),v_n,tc_nat))),v_a,tc_nat,tc_Complex_Ocomplex,tc_Complex_Ocomplex)),c_SetInterval_Oord__class_OatLeastLessThan(v_i,v_n,tc_nat)),
inference(demodulation,[status(thm)],[c_9606,c_39311]) ).
tcf(c_39356,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_39355]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV693-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 20:51:16 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 29.27/5.82 % SZS status Started for theBenchmark.p
% 29.27/5.82 ERROR - "ProverProcess:heur/381325:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 29.27/5.82 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 29.27/5.82 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 1 --comb_sup_mult 3 --conj_cone_tolerance 3. --demod_completeness_check full --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[Demod;DemodLoopTriv;LightNorm;ACNormalisation]" --sup_full_triv "[]" --sup_fun_splitting true --sup_immed_bw_immed "[]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes]" --sup_immed_fw_immed "[Subsumption;UnitSubsAndRes;Demod;DemodLoopTriv;LightNorm;DemodLightNormLoopTriv]" --sup_immed_fw_main "[Subsumption;SubsumptionRes;LightNorm;DemodLightNormLoopTriv]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;FwDemod]" --sup_input_bw "[UnitSubsAndRes]" --sup_input_fw "[]" --sup_input_triv "[PropSubs]" --sup_iter_deepening 0 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_symb;-max_atom_input_occur];[+horn];[+bc_imp_inh;+ground;-conj_dist]]" --sup_passive_queues_freq "[3;1;25]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 8 --sup_score sim_d_gen --sup_share_max_num_cl 40 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering arity_random --sup_to_prop_solver active --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_d489dvf0/nerbmt9u 2>> /export/starexec/sandbox/tmp/iprover_out_d489dvf0/nerbmt9u_error
% 29.27/5.82 ERROR - "ProverProcess:heur/397442:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 29.27/5.82 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 29.27/5.82 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 64 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 4 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 2 --inst_lit_activity_flag false --inst_lit_sel "[-split]" --inst_lit_sel_side num_lit --inst_orphan_elimination false --inst_passive_queue_type priority_queues --inst_passive_queues "[[+conj_symb]]" --inst_passive_queues_freq "[50]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.8199321230744955 --inst_solver_per_active 4 --inst_sos_flag false --inst_start_prop_sim_after_learn 7 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_d489dvf0/xacj6ubr 2>> /export/starexec/sandbox/tmp/iprover_out_d489dvf0/xacj6ubr_error
% 29.27/5.82 ERROR - "ProverProcess:heur/421498:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 29.27/5.82 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 29.27/5.82 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 8 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive false --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 128 --inst_lit_activity_flag false --inst_lit_sel "[+sign;+prop]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[+num_symb;-age;-age];[+num_symb;+conj_non_prolific_symb]]" --inst_passive_queues_freq "[512;10]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew model --inst_solver_calls_frac 0.006221608720445637 --inst_solver_per_active 32768 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+non_prol_conj_symb;+sign;-depth;-prop]" --inst_start_prop_sim_after_learn 9 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_d489dvf0/8npjpten 2>> /export/starexec/sandbox/tmp/iprover_out_d489dvf0/8npjpten_error
% 29.27/5.82 % SZS status Unsatisfiable for theBenchmark.p
% 29.27/5.82
% 29.27/5.82 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 29.27/5.82
% 29.27/5.82 % ------ iProver source info
% 29.27/5.82
% 29.27/5.82 % git: date: 2026-07-19 20:42:38 +0200
% 29.27/5.82 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 29.27/5.82 % git: non_committed_changes: false
% 29.27/5.82
% 29.27/5.82 % ------ Parsing...% successful
% 29.27/5.82
% 29.27/5.82
% 29.27/5.82 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 29.27/5.82
% 29.27/5.82 % ------ Preprocessing... sup_sim: 18 sf_s rm: 28 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 55 sf_s rm: 14 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 14 0s sf_e pe_s pe_e %
% 29.27/5.82
% 29.27/5.82 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 29.27/5.82
% 29.27/5.82 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 29.27/5.82 % ------ Proving...
% 29.27/5.82 % ------ Problem Properties
% 29.27/5.82
% 29.27/5.82 %
% 29.27/5.82 % clauses 538
% 29.27/5.82 % conjectures 0
% 29.27/5.82 % EPR 9
% 29.27/5.82 % Horn 422
% 29.27/5.82 % unary 195
% 29.27/5.82 % binary 152
% 29.27/5.82 % lits 1115
% 29.27/5.82 % lits eq 358
% 29.27/5.82 % fd_pure 0
% 29.27/5.82 % fd_pseudo 0
% 29.27/5.82 % fd_cond 36
% 29.27/5.82 % fd_pseudo_cond 35
% 29.27/5.82 % AC symbols 0
% 29.27/5.82
% 29.27/5.82 % ------ Schedule dynamic 5 is on
% 29.27/5.82
% 29.27/5.82 % ------ no conjectures: strip conj schedule
% 29.27/5.82
% 29.27/5.82 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 29.27/5.82
% 29.27/5.82
% 29.27/5.82 % ------
% 29.27/5.82 % Current options:
% 29.27/5.82 % ------
% 29.27/5.82
% 29.27/5.82
% 29.27/5.82 %
% 29.27/5.82
% 29.27/5.82 % ------ Proving...
% 29.27/5.82 %
% 29.27/5.82
% 29.27/5.82 % SZS status Unsatisfiable for theBenchmark.p
% 29.27/5.82
% 29.27/5.82 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 29.27/5.82
% 29.27/5.82
%------------------------------------------------------------------------------