%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ALG071+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 : n014.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 10.53s 2.28s
% Output : CNFRefutation 10.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of formulae : 85 ( 18 unt; 0 def)
% Number of atoms : 247 ( 77 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 279 ( 117 ~; 105 |; 33 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 9 ( 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 : 116 ( 0 sgn 112 !; 4 ?; 42 :)
% 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] :
( sorti1(X0)
=> ? [X1] :
( op1(X0,op1(X1,X0)) = X1
& op1(X1,op1(X1,X0)) != X0
& sorti1(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ! [X0] :
( sorti2(X0)
=> ? [X1] :
( op2(X0,op2(X1,X0)) = X1
& op2(X1,op2(X1,X0)) != X0
& sorti2(X1) ) ),
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] :
( sorti2(X0)
& ! [X1] :
( op2(X0,op2(X1,X0)) != X1
| op2(X1,op2(X1,X0)) = X0
| ~ sorti2(X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f10,plain,
! [X0] :
( ~ sorti1(X0)
| ? [X1] :
( op1(X0,op1(X1,X0)) = X1
& op1(X1,op1(X1,X0)) != X0
& sorti1(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
! [X0] :
( ~ sorti1(X0)
| ! [X1] :
( ~ sorti1(X1)
| sorti1(op1(X0,X1)) ) ),
inference(ennf_transformation,[],[f1]) ).
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,
( sorti2(sK0)
& ! [X1] :
( op2(sK0,op2(X1,sK0)) != X1
| sK0 = op2(X1,op2(X1,sK0))
| ~ sorti2(X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f9]) ).
fof(f15,plain,
! [X0] :
( ~ sorti1(X0)
| ( sK1(X0) = op1(X0,op1(sK1(X0),X0))
& op1(sK1(X0),op1(sK1(X0),X0)) != X0
& sorti1(sK1(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[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(f18,plain,
! [X5] :
( ~ sorti1(X5)
| j(h(X5)) = X5 ),
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(f21,plain,
! [X0,X1] :
( ~ sorti1(X0)
| ~ sorti1(X1)
| h(op1(X0,X1)) = op2(h(X0),h(X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
! [X1] :
( op2(sK0,op2(X1,sK0)) != X1
| sK0 = op2(X1,op2(X1,sK0))
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0] :
( ~ sorti1(X0)
| sK1(X0) = op1(X0,op1(sK1(X0),X0)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0] :
( ~ sorti1(X0)
| op1(sK1(X0),op1(sK1(X0),X0)) != X0 ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X0] :
( ~ sorti1(X0)
| sorti1(sK1(X0)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( ~ sorti1(X0)
| ~ sorti1(X1)
| sorti1(op1(X0,X1)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f28,plain,
! [X0,X1] :
( ~ sorti2(X0)
| ~ sorti2(X1)
| sorti2(op2(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] :
( ( op2(h(X0),h(X1)) = h(op1(X0,X1)) )
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f21]) ).
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_52,negated_conjecture,
! [X0: $i] :
( ( j(h(X0)) = X0 )
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f18]) ).
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] :
( ( op2(X0,op2(X0,sK0)) = sK0 )
| ~ sorti2(X0)
| ( op2(sK0,op2(X0,sK0)) != X0 ) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_56,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f22]) ).
tcf(c_57,plain,
! [X0: $i] :
( sorti1(sK1(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_58,plain,
! [X0: $i] :
( ~ sorti1(X0)
| ( op1(sK1(X0),op1(sK1(X0),X0)) != X0 ) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_59,plain,
! [X0: $i] :
( ( op1(X0,op1(sK1(X0),X0)) = sK1(X0) )
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_62,plain,
( sorti1(j(sK0))
| ~ sorti2(sK0) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_443,plain,
! [X0: $i,X1: $i] :
( ( op2(h(X0),h(j(X1))) = h(op1(X0,j(X1))) )
| ~ sorti2(X1)
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_54,c_49]) ).
tcf(c_454,plain,
! [X0: $i,X1: $i] :
( ( op1(j(h(X0)),j(X1)) = j(op2(h(X0),X1)) )
| ~ sorti2(X1)
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_53,c_50]) ).
tcf(c_481,plain,
! [X0: $i,X1: $i] :
( ( op2(h(j(X0)),h(j(X1))) = h(op1(j(X0),j(X1))) )
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_54,c_443]) ).
tcf(c_488,plain,
h(j(sK0)) = sK0,
inference(superposition,[status(thm)],[c_56,c_51]) ).
tcf(c_498,plain,
! [X0: $i] :
( ( j(h(sK1(X0))) = sK1(X0) )
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_57,c_52]) ).
tcf(c_549,plain,
! [X0: $i,X1: $i] :
( ( h(j(op2(X0,X1))) = op2(X0,X1) )
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_61,c_51]) ).
tcf(c_569,plain,
! [X0: $i] :
( ( j(h(sK1(j(X0)))) = sK1(j(X0)) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_54,c_498]) ).
tcf(c_588,plain,
! [X0: $i] :
( ( op1(j(X0),op1(sK1(j(X0)),j(X0))) = sK1(j(X0)) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_54,c_59]) ).
tcf(c_619,plain,
! [X0: $i] :
( sorti1(sK1(j(X0)))
| ~ sorti1(j(X0)) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_620,plain,
( sorti1(sK1(j(sK0)))
| ~ sorti1(j(sK0)) ),
inference(instantiation,[status(thm)],[c_619]) ).
tcf(c_642,plain,
! [X0: $i] :
( ~ sorti1(j(X0))
| ( op1(sK1(j(X0)),op1(sK1(j(X0)),j(X0))) != j(X0) ) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_643,plain,
( ~ sorti1(j(sK0))
| ( op1(sK1(j(sK0)),op1(sK1(j(sK0)),j(sK0))) != j(sK0) ) ),
inference(instantiation,[status(thm)],[c_642]) ).
tcf(c_649,plain,
j(h(sK1(j(sK0)))) = sK1(j(sK0)),
inference(superposition,[status(thm)],[c_56,c_569]) ).
tcf(c_713,plain,
! [X0: $i,X1: $i] :
( sorti1(op1(sK1(j(X0)),X1))
| ~ sorti1(X1)
| ~ sorti1(sK1(j(X0))) ),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_795,plain,
( sorti1(sK1(j(sK0)))
| ~ sorti2(h(sK1(j(sK0)))) ),
inference(superposition,[status(thm)],[c_649,c_54]) ).
tcf(c_808,plain,
sorti1(sK1(j(sK0))),
inference(global_subsumption_just,[status(thm)],[c_795,c_56,c_62,c_620]) ).
tcf(c_963,plain,
! [X0: $i,X1: $i] :
( ( h(j(op2(h(X0),X1))) = op2(h(X0),X1) )
| ~ sorti2(X1)
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_53,c_549]) ).
tcf(c_1036,plain,
op1(j(sK0),op1(sK1(j(sK0)),j(sK0))) = sK1(j(sK0)),
inference(superposition,[status(thm)],[c_56,c_588]) ).
tcf(c_1689,plain,
! [X0: $i,X1: $i] :
( sorti1(op1(sK1(j(X0)),j(X1)))
| ~ sorti1(j(X1))
| ~ sorti1(sK1(j(X0))) ),
inference(instantiation,[status(thm)],[c_713]) ).
tcf(c_1690,plain,
( sorti1(op1(sK1(j(sK0)),j(sK0)))
| ~ sorti1(j(sK0))
| ~ sorti1(sK1(j(sK0))) ),
inference(instantiation,[status(thm)],[c_1689]) ).
tcf(c_1805,plain,
! [X0: $i] :
( ( h(j(op2(h(sK1(j(sK0))),X0))) = op2(h(sK1(j(sK0))),X0) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_808,c_963]) ).
tcf(c_1900,plain,
! [X0: $i] :
( ( op1(j(h(sK1(j(sK0)))),j(X0)) = j(op2(h(sK1(j(sK0))),X0)) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_808,c_454]) ).
tcf(c_1904,plain,
! [X0: $i] :
( ( j(op2(h(sK1(j(sK0))),X0)) = op1(sK1(j(sK0)),j(X0)) )
| ~ sorti2(X0) ),
inference(light_normalisation,[status(thm)],[c_1900,c_649]) ).
tcf(c_4694,plain,
! [X0: $i] :
( ( j(op2(h(sK1(j(sK0))),h(X0))) = op1(sK1(j(sK0)),j(h(X0))) )
| ~ sorti1(X0) ),
inference(superposition,[status(thm)],[c_53,c_1904]) ).
tcf(c_4695,plain,
j(op2(h(sK1(j(sK0))),sK0)) = op1(sK1(j(sK0)),j(sK0)),
inference(superposition,[status(thm)],[c_56,c_1904]) ).
tcf(c_5179,plain,
! [X0: $i] :
( ( j(op2(h(sK1(j(sK0))),h(j(X0)))) = op1(sK1(j(sK0)),j(h(j(X0)))) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_54,c_4694]) ).
tcf(c_5248,plain,
( sorti1(op1(sK1(j(sK0)),j(sK0)))
| ~ sorti2(op2(h(sK1(j(sK0))),sK0)) ),
inference(superposition,[status(thm)],[c_4695,c_54]) ).
tcf(c_5251,plain,
sorti1(op1(sK1(j(sK0)),j(sK0))),
inference(global_subsumption_just,[status(thm)],[c_5248,c_56,c_62,c_620,c_1690]) ).
tcf(c_6285,plain,
! [X0: $i] :
( ( op2(h(j(sK0)),h(j(X0))) = h(op1(j(sK0),j(X0))) )
| ~ sorti2(X0) ),
inference(superposition,[status(thm)],[c_56,c_481]) ).
tcf(c_6293,plain,
! [X0: $i] :
( ( h(op1(j(sK0),j(X0))) = op2(sK0,h(j(X0))) )
| ~ sorti2(X0) ),
inference(light_normalisation,[status(thm)],[c_6285,c_488]) ).
tcf(c_8283,plain,
h(j(op2(h(sK1(j(sK0))),sK0))) = op2(h(sK1(j(sK0))),sK0),
inference(superposition,[status(thm)],[c_56,c_1805]) ).
tcf(c_8292,plain,
h(op1(sK1(j(sK0)),j(sK0))) = op2(h(sK1(j(sK0))),sK0),
inference(light_normalisation,[status(thm)],[c_8283,c_4695]) ).
tcf(c_8367,plain,
( sorti2(op2(h(sK1(j(sK0))),sK0))
| ~ sorti1(op1(sK1(j(sK0)),j(sK0))) ),
inference(superposition,[status(thm)],[c_8292,c_53]) ).
tcf(c_8368,plain,
sorti2(op2(h(sK1(j(sK0))),sK0)),
inference(forward_subsumption_resolution,[status(thm)],[c_8367,c_5251]) ).
tcf(c_8670,plain,
h(op1(j(sK0),j(op2(h(sK1(j(sK0))),sK0)))) = op2(sK0,h(j(op2(h(sK1(j(sK0))),sK0)))),
inference(superposition,[status(thm)],[c_8368,c_6293]) ).
tcf(c_8723,plain,
op2(sK0,op2(h(sK1(j(sK0))),sK0)) = h(sK1(j(sK0))),
inference(light_normalisation,[status(thm)],[c_8670,c_1036,c_4695,c_8292]) ).
tcf(c_8968,plain,
( sorti2(h(sK1(j(sK0))))
| ~ sorti2(sK0)
| ~ sorti2(op2(h(sK1(j(sK0))),sK0)) ),
inference(superposition,[status(thm)],[c_8723,c_61]) ).
tcf(c_8969,plain,
( ( op2(h(sK1(j(sK0))),op2(h(sK1(j(sK0))),sK0)) = sK0 )
| ~ sorti2(h(sK1(j(sK0)))) ),
inference(superposition,[status(thm)],[c_8723,c_55]) ).
tcf(c_8970,plain,
sorti2(h(sK1(j(sK0)))),
inference(forward_subsumption_resolution,[status(thm)],[c_8968,c_56,c_8368]) ).
tcf(c_8971,plain,
op2(h(sK1(j(sK0))),op2(h(sK1(j(sK0))),sK0)) = sK0,
inference(forward_subsumption_resolution,[status(thm)],[c_8969,c_8970]) ).
tcf(c_18341,plain,
j(op2(h(sK1(j(sK0))),h(j(op2(h(sK1(j(sK0))),sK0))))) = op1(sK1(j(sK0)),j(h(j(op2(h(sK1(j(sK0))),sK0))))),
inference(superposition,[status(thm)],[c_8368,c_5179]) ).
tcf(c_18351,plain,
op1(sK1(j(sK0)),op1(sK1(j(sK0)),j(sK0))) = j(sK0),
inference(light_normalisation,[status(thm)],[c_18341,c_4695,c_8292,c_8971]) ).
tcf(c_18362,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_18351,c_643,c_62,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG071+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 : n014.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:41:47 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...
% 10.53/2.28 % SZS status Started for theBenchmark.p
% 10.53/2.28 % SZS status Theorem for theBenchmark.p
% 10.53/2.28
% 10.53/2.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.53/2.28
% 10.53/2.28 % ------ iProver source info
% 10.53/2.28
% 10.53/2.28 % git: date: 2026-07-19 20:42:38 +0200
% 10.53/2.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.53/2.28 % git: non_committed_changes: false
% 10.53/2.28
% 10.53/2.28 % ------ Parsing...
% 10.53/2.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.53/2.28
% 10.53/2.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 10.53/2.28
% 10.53/2.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 10.53/2.28
% 10.53/2.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.53/2.28 % ------ Proving...
% 10.53/2.28 % ------ Problem Properties
% 10.53/2.28
% 10.53/2.28 %
% 10.53/2.28 % clauses 13
% 10.53/2.28 % conjectures 6
% 10.53/2.28 % EPR 1
% 10.53/2.28 % Horn 13
% 10.53/2.28 % unary 1
% 10.53/2.28 % binary 7
% 10.53/2.28 % lits 30
% 10.53/2.28 % lits eq 8
% 10.53/2.28 % fd_pure 0
% 10.53/2.28 % fd_pseudo 0
% 10.53/2.28 % fd_cond 0
% 10.53/2.28 % fd_pseudo_cond 0
% 10.53/2.28 % AC symbols 0
% 10.53/2.28
% 10.53/2.28 % ------ Schedule dynamic 5 is on
% 10.53/2.28
% 10.53/2.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.53/2.28
% 10.53/2.28
% 10.53/2.28 % ------
% 10.53/2.28 % Current options:
% 10.53/2.28 % ------
% 10.53/2.28
% 10.53/2.28
% 10.53/2.28 %
% 10.53/2.28
% 10.53/2.28 % ------ Proving...
% 10.53/2.28 %
% 10.53/2.28
% 10.53/2.28 % SZS status Theorem for theBenchmark.p
% 10.53/2.28
% 10.53/2.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.53/2.28
% 10.53/2.28
%------------------------------------------------------------------------------