TSTP Solution File: ALG071+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG071+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:03:34 EDT 2024
% Result : Theorem 17.49s 3.15s
% Output : CNFRefutation 17.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 7
% Syntax : Number of formulae : 107 ( 22 unt; 0 def)
% Number of atoms : 312 ( 105 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 348 ( 143 ~; 127 |; 43 &)
% ( 0 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 12 ( 2 avg)
% 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 : 145 ( 0 sgn 81 !; 6 ?)
% 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,[],[f5]) ).
fof(f7,plain,
~ ( ( ! [X0] :
( sorti2(X0)
=> sorti1(j(X0)) )
& ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 )
& ! [X3] :
( sorti2(X3)
=> h(j(X3)) = X3 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti1(X6)
=> ! [X7] :
( sorti1(X7)
=> h(op1(X6,X7)) = op2(h(X6),h(X7)) ) ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ! [X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f9,plain,
! [X0] :
( ! [X1] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1) )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f10,plain,
! [X0] :
( ? [X1] :
( op1(X0,op1(X1,X0)) = X1
& op1(X1,op1(X1,X0)) != X0
& sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
? [X0] :
( ! [X1] :
( op2(X0,op2(X1,X0)) != X1
| op2(X1,op2(X1,X0)) = X0
| ~ sorti2(X1) )
& sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X0] :
( ? [X1] :
( op1(X0,op1(X1,X0)) = X1
& op1(X1,op1(X1,X0)) != X0
& sorti1(X1) )
=> ( sK0(X0) = op1(X0,op1(sK0(X0),X0))
& op1(sK0(X0),op1(sK0(X0),X0)) != X0
& sorti1(sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ( sK0(X0) = op1(X0,op1(sK0(X0),X0))
& op1(sK0(X0),op1(sK0(X0),X0)) != X0
& sorti1(sK0(X0)) )
| ~ sorti1(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f14]) ).
fof(f16,plain,
( ? [X0] :
( ! [X1] :
( op2(X0,op2(X1,X0)) != X1
| op2(X1,op2(X1,X0)) = X0
| ~ sorti2(X1) )
& sorti2(X0) )
=> ( ! [X1] :
( op2(sK1,op2(X1,sK1)) != X1
| sK1 = op2(X1,op2(X1,sK1))
| ~ sorti2(X1) )
& sorti2(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ! [X1] :
( op2(sK1,op2(X1,sK1)) != X1
| sK1 = op2(X1,op2(X1,sK1))
| ~ sorti2(X1) )
& sorti2(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f16]) ).
fof(f18,plain,
( ! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) )
& ! [X1] :
( h(j(X1)) = X1
| ~ sorti2(X1) )
& ! [X2] :
( ! [X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3) )
| ~ sorti2(X2) )
& ! [X4] :
( ! [X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5) )
| ~ sorti1(X4) )
& ! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) )
& ! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ) ),
inference(rectify,[],[f13]) ).
fof(f19,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
! [X0] :
( sorti1(sK0(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0] :
( op1(sK0(X0),op1(sK0(X0),X0)) != X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
! [X0] :
( sK0(X0) = op1(X0,op1(sK0(X0),X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
sorti2(sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
! [X1] :
( op2(sK1,op2(X1,sK1)) != X1
| sK1 = op2(X1,op2(X1,sK1))
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f26,plain,
! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X4,X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5)
| ~ sorti1(X4) ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X2,X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3)
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
! [X1] :
( h(j(X1)) = X1
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_49,plain,
( ~ sorti1(X0)
| ~ sorti1(X1)
| sorti1(op1(X0,X1)) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_50,plain,
( ~ sorti2(X0)
| ~ sorti2(X1)
| sorti2(op2(X0,X1)) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_51,plain,
( ~ sorti1(X0)
| op1(X0,op1(sK0(X0),X0)) = sK0(X0) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_52,plain,
( op1(sK0(X0),op1(sK0(X0),X0)) != X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_53,plain,
( ~ sorti1(X0)
| sorti1(sK0(X0)) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_54,plain,
( op2(sK1,op2(X0,sK1)) != X0
| ~ sorti2(X0)
| op2(X0,op2(X0,sK1)) = sK1 ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,plain,
sorti2(sK1),
inference(cnf_transformation,[],[f24]) ).
cnf(c_56,negated_conjecture,
( ~ sorti1(X0)
| j(h(X0)) = X0 ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_57,negated_conjecture,
( ~ sorti2(X0)
| h(j(X0)) = X0 ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_58,negated_conjecture,
( ~ sorti2(X0)
| ~ sorti2(X1)
| op1(j(X0),j(X1)) = j(op2(X0,X1)) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_59,negated_conjecture,
( ~ sorti1(X0)
| ~ sorti1(X1)
| op2(h(X0),h(X1)) = h(op1(X0,X1)) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_60,negated_conjecture,
( ~ sorti2(X0)
| sorti1(j(X0)) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_61,negated_conjecture,
( ~ sorti1(X0)
| sorti2(h(X0)) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_63,plain,
( ~ sorti2(sK1)
| sorti1(j(sK1)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_198,negated_conjecture,
( ~ sorti1(X0)
| sorti2(h(X0)) ),
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_199,negated_conjecture,
( ~ sorti2(X0)
| sorti1(j(X0)) ),
inference(demodulation,[status(thm)],[c_60]) ).
cnf(c_200,negated_conjecture,
( ~ sorti1(X0)
| ~ sorti1(X1)
| op2(h(X0),h(X1)) = h(op1(X0,X1)) ),
inference(demodulation,[status(thm)],[c_59]) ).
cnf(c_201,negated_conjecture,
( ~ sorti2(X0)
| ~ sorti2(X1)
| op1(j(X0),j(X1)) = j(op2(X0,X1)) ),
inference(demodulation,[status(thm)],[c_58]) ).
cnf(c_202,negated_conjecture,
( ~ sorti2(X0)
| h(j(X0)) = X0 ),
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_203,negated_conjecture,
( ~ sorti1(X0)
| j(h(X0)) = X0 ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_449,plain,
( ~ sorti1(X0)
| ~ sorti2(X1)
| op2(h(X0),h(j(X1))) = h(op1(X0,j(X1))) ),
inference(superposition,[status(thm)],[c_199,c_200]) ).
cnf(c_460,plain,
( ~ sorti1(X0)
| ~ sorti2(X1)
| op1(j(X1),j(h(X0))) = j(op2(X1,h(X0))) ),
inference(superposition,[status(thm)],[c_198,c_201]) ).
cnf(c_492,plain,
( ~ sorti2(X0)
| op1(j(X0),j(sK1)) = j(op2(X0,sK1)) ),
inference(superposition,[status(thm)],[c_55,c_201]) ).
cnf(c_504,plain,
( ~ sorti1(X0)
| j(h(sK0(X0))) = sK0(X0) ),
inference(superposition,[status(thm)],[c_53,c_203]) ).
cnf(c_528,plain,
( ~ sorti1(X0)
| ~ sorti1(X1)
| j(h(op1(X0,X1))) = op1(X0,X1) ),
inference(superposition,[status(thm)],[c_49,c_203]) ).
cnf(c_555,plain,
( ~ sorti2(X0)
| ~ sorti2(X1)
| h(j(op2(X0,X1))) = op2(X0,X1) ),
inference(superposition,[status(thm)],[c_50,c_202]) ).
cnf(c_577,plain,
( ~ sorti2(X0)
| j(h(sK0(j(X0)))) = sK0(j(X0)) ),
inference(superposition,[status(thm)],[c_199,c_504]) ).
cnf(c_596,plain,
( ~ sorti2(X0)
| op1(j(X0),op1(sK0(j(X0)),j(X0))) = sK0(j(X0)) ),
inference(superposition,[status(thm)],[c_199,c_51]) ).
cnf(c_625,plain,
( ~ sorti1(j(X0))
| sorti1(sK0(j(X0))) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_626,plain,
( ~ sorti1(j(sK1))
| sorti1(sK0(j(sK1))) ),
inference(instantiation,[status(thm)],[c_625]) ).
cnf(c_655,plain,
j(h(sK0(j(sK1)))) = sK0(j(sK1)),
inference(superposition,[status(thm)],[c_55,c_577]) ).
cnf(c_664,plain,
( op1(sK0(j(X0)),op1(sK0(j(X0)),j(X0))) != j(X0)
| ~ sorti1(j(X0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_665,plain,
( op1(sK0(j(sK1)),op1(sK0(j(sK1)),j(sK1))) != j(sK1)
| ~ sorti1(j(sK1)) ),
inference(instantiation,[status(thm)],[c_664]) ).
cnf(c_672,plain,
( ~ sorti1(X0)
| op1(j(h(X0)),j(sK1)) = j(op2(h(X0),sK1)) ),
inference(superposition,[status(thm)],[c_198,c_492]) ).
cnf(c_723,plain,
( ~ sorti1(sK0(j(X0)))
| sorti2(h(sK0(j(X0)))) ),
inference(instantiation,[status(thm)],[c_198]) ).
cnf(c_724,plain,
( ~ sorti1(sK0(j(sK1)))
| sorti2(h(sK0(j(sK1)))) ),
inference(instantiation,[status(thm)],[c_723]) ).
cnf(c_770,plain,
( ~ sorti1(X0)
| ~ sorti2(X1)
| j(h(op1(X0,j(X1)))) = op1(X0,j(X1)) ),
inference(superposition,[status(thm)],[c_199,c_528]) ).
cnf(c_801,plain,
( ~ sorti2(h(sK0(j(sK1))))
| sorti1(sK0(j(sK1))) ),
inference(superposition,[status(thm)],[c_655,c_199]) ).
cnf(c_814,plain,
sorti1(sK0(j(sK1))),
inference(global_subsumption_just,[status(thm)],[c_801,c_55,c_63,c_626]) ).
cnf(c_823,plain,
( ~ sorti2(X0)
| op2(h(sK0(j(sK1))),h(j(X0))) = h(op1(sK0(j(sK1)),j(X0))) ),
inference(superposition,[status(thm)],[c_814,c_449]) ).
cnf(c_970,plain,
( ~ sorti2(X0)
| h(j(op2(X0,sK1))) = op2(X0,sK1) ),
inference(superposition,[status(thm)],[c_55,c_555]) ).
cnf(c_971,plain,
( ~ sorti1(X0)
| ~ sorti2(X1)
| h(j(op2(X1,h(X0)))) = op2(X1,h(X0)) ),
inference(superposition,[status(thm)],[c_198,c_555]) ).
cnf(c_994,plain,
op1(j(h(sK0(j(sK1)))),j(sK1)) = j(op2(h(sK0(j(sK1))),sK1)),
inference(superposition,[status(thm)],[c_814,c_672]) ).
cnf(c_997,plain,
j(op2(h(sK0(j(sK1))),sK1)) = op1(sK0(j(sK1)),j(sK1)),
inference(light_normalisation,[status(thm)],[c_994,c_655]) ).
cnf(c_1042,plain,
op1(j(sK1),op1(sK0(j(sK1)),j(sK1))) = sK0(j(sK1)),
inference(superposition,[status(thm)],[c_55,c_596]) ).
cnf(c_1138,plain,
( ~ sorti2(X0)
| j(h(op1(sK0(j(sK1)),j(X0)))) = op1(sK0(j(sK1)),j(X0)) ),
inference(superposition,[status(thm)],[c_814,c_770]) ).
cnf(c_1296,plain,
( ~ sorti1(X0)
| h(j(op2(h(X0),sK1))) = op2(h(X0),sK1) ),
inference(superposition,[status(thm)],[c_198,c_970]) ).
cnf(c_1402,plain,
h(j(op2(h(sK0(j(sK1))),sK1))) = op2(h(sK0(j(sK1))),sK1),
inference(superposition,[status(thm)],[c_814,c_1296]) ).
cnf(c_1405,plain,
h(op1(sK0(j(sK1)),j(sK1))) = op2(h(sK0(j(sK1))),sK1),
inference(light_normalisation,[status(thm)],[c_1402,c_997]) ).
cnf(c_1631,plain,
( ~ sorti2(op2(h(sK0(j(sK1))),sK1))
| sorti1(op1(sK0(j(sK1)),j(sK1))) ),
inference(superposition,[status(thm)],[c_997,c_199]) ).
cnf(c_1656,plain,
( ~ sorti2(h(sK0(j(sK1))))
| ~ sorti2(sK1)
| sorti1(op1(sK0(j(sK1)),j(sK1))) ),
inference(superposition,[status(thm)],[c_50,c_1631]) ).
cnf(c_1657,plain,
( ~ sorti2(h(sK0(j(sK1))))
| sorti1(op1(sK0(j(sK1)),j(sK1))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1656,c_55]) ).
cnf(c_1724,plain,
( ~ sorti2(X0)
| ~ sorti2(X1)
| h(j(op2(X1,h(j(X0))))) = op2(X1,h(j(X0))) ),
inference(superposition,[status(thm)],[c_199,c_971]) ).
cnf(c_1842,plain,
( ~ sorti2(X0)
| ~ sorti2(X1)
| op1(j(X1),j(h(j(X0)))) = j(op2(X1,h(j(X0)))) ),
inference(superposition,[status(thm)],[c_199,c_460]) ).
cnf(c_2004,plain,
sorti1(op1(sK0(j(sK1)),j(sK1))),
inference(global_subsumption_just,[status(thm)],[c_1657,c_55,c_63,c_626,c_724,c_1657]) ).
cnf(c_2233,plain,
( ~ sorti1(op1(sK0(j(sK1)),j(sK1)))
| sorti2(op2(h(sK0(j(sK1))),sK1)) ),
inference(superposition,[status(thm)],[c_1405,c_198]) ).
cnf(c_2234,plain,
sorti2(op2(h(sK0(j(sK1))),sK1)),
inference(forward_subsumption_resolution,[status(thm)],[c_2233,c_2004]) ).
cnf(c_4140,plain,
( ~ sorti2(X0)
| h(j(op2(sK1,h(j(X0))))) = op2(sK1,h(j(X0))) ),
inference(superposition,[status(thm)],[c_55,c_1724]) ).
cnf(c_4606,plain,
( ~ sorti1(X0)
| h(j(op2(sK1,h(j(h(X0)))))) = op2(sK1,h(j(h(X0)))) ),
inference(superposition,[status(thm)],[c_198,c_4140]) ).
cnf(c_5006,plain,
( ~ sorti2(X0)
| h(j(op2(sK1,h(j(h(j(X0))))))) = op2(sK1,h(j(h(j(X0))))) ),
inference(superposition,[status(thm)],[c_199,c_4606]) ).
cnf(c_5161,plain,
( ~ sorti2(X0)
| op1(j(sK1),j(h(j(X0)))) = j(op2(sK1,h(j(X0)))) ),
inference(superposition,[status(thm)],[c_55,c_1842]) ).
cnf(c_7176,plain,
op1(j(sK1),j(h(j(op2(h(sK0(j(sK1))),sK1))))) = j(op2(sK1,h(j(op2(h(sK0(j(sK1))),sK1))))),
inference(superposition,[status(thm)],[c_2234,c_5161]) ).
cnf(c_7189,plain,
j(op2(sK1,op2(h(sK0(j(sK1))),sK1))) = sK0(j(sK1)),
inference(light_normalisation,[status(thm)],[c_7176,c_997,c_1042,c_1405]) ).
cnf(c_9853,plain,
h(j(op2(sK1,h(j(h(j(op2(h(sK0(j(sK1))),sK1)))))))) = op2(sK1,h(j(h(j(op2(h(sK0(j(sK1))),sK1)))))),
inference(superposition,[status(thm)],[c_2234,c_5006]) ).
cnf(c_9867,plain,
op2(sK1,op2(h(sK0(j(sK1))),sK1)) = h(sK0(j(sK1))),
inference(light_normalisation,[status(thm)],[c_9853,c_997,c_1405,c_7189]) ).
cnf(c_10365,plain,
( ~ sorti2(op2(h(sK0(j(sK1))),sK1))
| ~ sorti2(sK1)
| sorti2(h(sK0(j(sK1)))) ),
inference(superposition,[status(thm)],[c_9867,c_50]) ).
cnf(c_10366,plain,
( ~ sorti2(h(sK0(j(sK1))))
| op2(h(sK0(j(sK1))),op2(h(sK0(j(sK1))),sK1)) = sK1 ),
inference(superposition,[status(thm)],[c_9867,c_54]) ).
cnf(c_10367,plain,
sorti2(h(sK0(j(sK1)))),
inference(forward_subsumption_resolution,[status(thm)],[c_10365,c_55,c_2234]) ).
cnf(c_10368,plain,
op2(h(sK0(j(sK1))),op2(h(sK0(j(sK1))),sK1)) = sK1,
inference(forward_subsumption_resolution,[status(thm)],[c_10366,c_10367]) ).
cnf(c_11244,plain,
( ~ sorti1(X0)
| j(h(op1(sK0(j(sK1)),j(h(X0))))) = op1(sK0(j(sK1)),j(h(X0))) ),
inference(superposition,[status(thm)],[c_198,c_1138]) ).
cnf(c_11501,plain,
( ~ sorti2(X0)
| j(h(op1(sK0(j(sK1)),j(h(j(X0)))))) = op1(sK0(j(sK1)),j(h(j(X0)))) ),
inference(superposition,[status(thm)],[c_199,c_11244]) ).
cnf(c_26093,plain,
op2(h(sK0(j(sK1))),h(j(op2(h(sK0(j(sK1))),sK1)))) = h(op1(sK0(j(sK1)),j(op2(h(sK0(j(sK1))),sK1)))),
inference(superposition,[status(thm)],[c_2234,c_823]) ).
cnf(c_26116,plain,
h(op1(sK0(j(sK1)),op1(sK0(j(sK1)),j(sK1)))) = sK1,
inference(light_normalisation,[status(thm)],[c_26093,c_997,c_1405,c_10368]) ).
cnf(c_40913,plain,
j(h(op1(sK0(j(sK1)),j(h(j(op2(h(sK0(j(sK1))),sK1))))))) = op1(sK0(j(sK1)),j(h(j(op2(h(sK0(j(sK1))),sK1))))),
inference(superposition,[status(thm)],[c_2234,c_11501]) ).
cnf(c_40940,plain,
op1(sK0(j(sK1)),op1(sK0(j(sK1)),j(sK1))) = j(sK1),
inference(light_normalisation,[status(thm)],[c_40913,c_997,c_1405,c_26116]) ).
cnf(c_40961,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_40940,c_665,c_63,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ALG071+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:05:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 17.49/3.15 % SZS status Started for theBenchmark.p
% 17.49/3.15 % SZS status Theorem for theBenchmark.p
% 17.49/3.15
% 17.49/3.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 17.49/3.15
% 17.49/3.15 ------ iProver source info
% 17.49/3.15
% 17.49/3.15 git: date: 2024-05-02 19:28:25 +0000
% 17.49/3.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 17.49/3.15 git: non_committed_changes: false
% 17.49/3.15
% 17.49/3.15 ------ Parsing...
% 17.49/3.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 17.49/3.15
% 17.49/3.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 17.49/3.15
% 17.49/3.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.49/3.15
% 17.49/3.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.49/3.15 ------ Proving...
% 17.49/3.15 ------ Problem Properties
% 17.49/3.15
% 17.49/3.15
% 17.49/3.15 clauses 13
% 17.49/3.15 conjectures 6
% 17.49/3.15 EPR 1
% 17.49/3.15 Horn 13
% 17.49/3.15 unary 1
% 17.49/3.15 binary 7
% 17.49/3.15 lits 30
% 17.49/3.15 lits eq 8
% 17.49/3.15 fd_pure 0
% 17.49/3.15 fd_pseudo 0
% 17.49/3.15 fd_cond 0
% 17.49/3.15 fd_pseudo_cond 0
% 17.49/3.15 AC symbols 0
% 17.49/3.15
% 17.49/3.15 ------ Schedule dynamic 5 is on
% 17.49/3.15
% 17.49/3.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 17.49/3.15
% 17.49/3.15
% 17.49/3.15 ------
% 17.49/3.15 Current options:
% 17.49/3.15 ------
% 17.49/3.15
% 17.49/3.15
% 17.49/3.15
% 17.49/3.15
% 17.49/3.15 ------ Proving...
% 17.49/3.15
% 17.49/3.15
% 17.49/3.15 % SZS status Theorem for theBenchmark.p
% 17.49/3.15
% 17.49/3.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.49/3.15
% 17.49/3.15
%------------------------------------------------------------------------------