TSTP Solution File: GRP776+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP776+1 : TPTP v8.1.2. Released v4.1.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 : Thu Aug 31 01:01:47 EDT 2023
% Result : Theorem 69.22s 10.24s
% Output : CNFRefutation 69.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 15
% Syntax : Number of formulae : 143 ( 53 unt; 0 def)
% Number of atoms : 260 ( 122 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 214 ( 97 ~; 86 |; 11 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 146 ( 6 sgn; 60 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X1] :
( g(X1)
=> g(inv(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos02) ).
fof(f3,axiom,
g(eh),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos03) ).
fof(f6,axiom,
! [X1] :
( g(X1)
=> product(X1,eh) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos06) ).
fof(f8,axiom,
! [X1] :
( g(X1)
=> eh = product(inv(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos08) ).
fof(f10,axiom,
! [X0,X1] :
( h(X1)
=> h(opp(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos10) ).
fof(f11,axiom,
h(eg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos11) ).
fof(f12,axiom,
! [X2,X0,X1] :
( ( h(X2)
& h(X0)
& h(X1) )
=> sum(sum(X1,X0),X2) = sum(X1,sum(X0,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos12) ).
fof(f13,axiom,
! [X1] :
( h(X1)
=> sum(eg,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos13) ).
fof(f14,axiom,
! [X1] :
( h(X1)
=> sum(X1,eg) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos14) ).
fof(f15,axiom,
! [X1] :
( h(X1)
=> eg = sum(X1,opp(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos15) ).
fof(f16,axiom,
! [X1] :
( h(X1)
=> eg = sum(opp(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos16) ).
fof(f17,axiom,
! [X1] :
( g(X1)
=> h(f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos17) ).
fof(f18,axiom,
! [X0,X1] : f(product(X1,X0)) = sum(f(X1),f(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos18) ).
fof(f19,conjecture,
! [X3] :
( ( f(inv(X3)) = opp(f(X3))
| ~ g(X3) )
& eg = f(eh) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3] :
( ( f(inv(X3)) = opp(f(X3))
| ~ g(X3) )
& eg = f(eh) ),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
! [X0] :
( g(X0)
=> g(inv(X0)) ),
inference(rectify,[],[f2]) ).
fof(f24,plain,
! [X0] :
( g(X0)
=> product(X0,eh) = X0 ),
inference(rectify,[],[f6]) ).
fof(f26,plain,
! [X0] :
( g(X0)
=> eh = product(inv(X0),X0) ),
inference(rectify,[],[f8]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( h(X0)
& h(X1)
& h(X2) )
=> sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0)) ),
inference(rectify,[],[f12]) ).
fof(f28,plain,
! [X0] :
( h(X0)
=> sum(eg,X0) = X0 ),
inference(rectify,[],[f13]) ).
fof(f29,plain,
! [X0] :
( h(X0)
=> sum(X0,eg) = X0 ),
inference(rectify,[],[f14]) ).
fof(f30,plain,
! [X0] :
( h(X0)
=> eg = sum(X0,opp(X0)) ),
inference(rectify,[],[f15]) ).
fof(f31,plain,
! [X0] :
( h(X0)
=> eg = sum(opp(X0),X0) ),
inference(rectify,[],[f16]) ).
fof(f32,plain,
! [X0] :
( g(X0)
=> h(f(X0)) ),
inference(rectify,[],[f17]) ).
fof(f33,plain,
~ ! [X0] :
( ( f(inv(X0)) = opp(f(X0))
| ~ g(X0) )
& eg = f(eh) ),
inference(rectify,[],[f20]) ).
fof(f36,plain,
! [X0] :
( g(inv(X0))
| ~ g(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f40,plain,
! [X0] :
( product(X0,eh) = X0
| ~ g(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f42,plain,
! [X0] :
( eh = product(inv(X0),X0)
| ~ g(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f45,plain,
! [X0,X1] :
( h(opp(X0))
| ~ h(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f46,plain,
! [X0,X1,X2] :
( sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0))
| ~ h(X0)
| ~ h(X1)
| ~ h(X2) ),
inference(ennf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0,X1,X2] :
( sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0))
| ~ h(X0)
| ~ h(X1)
| ~ h(X2) ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
! [X0] :
( sum(eg,X0) = X0
| ~ h(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f49,plain,
! [X0] :
( sum(X0,eg) = X0
| ~ h(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f50,plain,
! [X0] :
( eg = sum(X0,opp(X0))
| ~ h(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f51,plain,
! [X0] :
( eg = sum(opp(X0),X0)
| ~ h(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f52,plain,
! [X0] :
( h(f(X0))
| ~ g(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f53,plain,
? [X0] :
( ( f(inv(X0)) != opp(f(X0))
& g(X0) )
| eg != f(eh) ),
inference(ennf_transformation,[],[f33]) ).
fof(f54,plain,
( ? [X0] :
( ( f(inv(X0)) != opp(f(X0))
& g(X0) )
| eg != f(eh) )
=> ( ( f(inv(sK0)) != opp(f(sK0))
& g(sK0) )
| eg != f(eh) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
( ( f(inv(sK0)) != opp(f(sK0))
& g(sK0) )
| eg != f(eh) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f53,f54]) ).
fof(f57,plain,
! [X0] :
( g(inv(X0))
| ~ g(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f58,plain,
g(eh),
inference(cnf_transformation,[],[f3]) ).
fof(f61,plain,
! [X0] :
( product(X0,eh) = X0
| ~ g(X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f63,plain,
! [X0] :
( eh = product(inv(X0),X0)
| ~ g(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f65,plain,
! [X0,X1] :
( h(opp(X0))
| ~ h(X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f66,plain,
h(eg),
inference(cnf_transformation,[],[f11]) ).
fof(f67,plain,
! [X2,X0,X1] :
( sum(sum(X2,X1),X0) = sum(X2,sum(X1,X0))
| ~ h(X0)
| ~ h(X1)
| ~ h(X2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f68,plain,
! [X0] :
( sum(eg,X0) = X0
| ~ h(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f69,plain,
! [X0] :
( sum(X0,eg) = X0
| ~ h(X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f70,plain,
! [X0] :
( eg = sum(X0,opp(X0))
| ~ h(X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f71,plain,
! [X0] :
( eg = sum(opp(X0),X0)
| ~ h(X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f72,plain,
! [X0] :
( h(f(X0))
| ~ g(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f73,plain,
! [X0,X1] : f(product(X1,X0)) = sum(f(X1),f(X0)),
inference(cnf_transformation,[],[f18]) ).
fof(f74,plain,
( g(sK0)
| eg != f(eh) ),
inference(cnf_transformation,[],[f55]) ).
fof(f75,plain,
( f(inv(sK0)) != opp(f(sK0))
| eg != f(eh) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_50,plain,
( ~ g(X0)
| g(inv(X0)) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_51,plain,
g(eh),
inference(cnf_transformation,[],[f58]) ).
cnf(c_54,plain,
( ~ g(X0)
| product(X0,eh) = X0 ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_56,plain,
( ~ g(X0)
| product(inv(X0),X0) = eh ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_58,plain,
( ~ h(X0)
| h(opp(X1)) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_59,plain,
h(eg),
inference(cnf_transformation,[],[f66]) ).
cnf(c_60,plain,
( ~ h(X0)
| ~ h(X1)
| ~ h(X2)
| sum(sum(X2,X0),X1) = sum(X2,sum(X0,X1)) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_61,plain,
( ~ h(X0)
| sum(eg,X0) = X0 ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_62,plain,
( ~ h(X0)
| sum(X0,eg) = X0 ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_63,plain,
( ~ h(X0)
| sum(X0,opp(X0)) = eg ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_64,plain,
( ~ h(X0)
| sum(opp(X0),X0) = eg ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_65,plain,
( ~ g(X0)
| h(f(X0)) ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_66,plain,
sum(f(X0),f(X1)) = f(product(X0,X1)),
inference(cnf_transformation,[],[f73]) ).
cnf(c_67,negated_conjecture,
( opp(f(sK0)) != f(inv(sK0))
| f(eh) != eg ),
inference(cnf_transformation,[],[f75]) ).
cnf(c_68,negated_conjecture,
( f(eh) != eg
| g(sK0) ),
inference(cnf_transformation,[],[f74]) ).
cnf(c_218,negated_conjecture,
( f(eh) != eg
| g(sK0) ),
inference(subtyping,[status(esa)],[c_68]) ).
cnf(c_219,negated_conjecture,
( opp(f(sK0)) != f(inv(sK0))
| f(eh) != eg ),
inference(subtyping,[status(esa)],[c_67]) ).
cnf(c_220,plain,
sum(f(X0_14),f(X1_14)) = f(product(X0_14,X1_14)),
inference(subtyping,[status(esa)],[c_66]) ).
cnf(c_221,plain,
( ~ g(X0_14)
| h(f(X0_14)) ),
inference(subtyping,[status(esa)],[c_65]) ).
cnf(c_222,plain,
( ~ h(X0_13)
| sum(opp(X0_13),X0_13) = eg ),
inference(subtyping,[status(esa)],[c_64]) ).
cnf(c_223,plain,
( ~ h(X0_13)
| sum(X0_13,opp(X0_13)) = eg ),
inference(subtyping,[status(esa)],[c_63]) ).
cnf(c_224,plain,
( ~ h(X0_13)
| sum(X0_13,eg) = X0_13 ),
inference(subtyping,[status(esa)],[c_62]) ).
cnf(c_225,plain,
( ~ h(X0_13)
| sum(eg,X0_13) = X0_13 ),
inference(subtyping,[status(esa)],[c_61]) ).
cnf(c_226,plain,
( ~ h(X0_13)
| ~ h(X1_13)
| ~ h(X2_13)
| sum(sum(X2_13,X0_13),X1_13) = sum(X2_13,sum(X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_60]) ).
cnf(c_227,plain,
h(eg),
inference(subtyping,[status(esa)],[c_59]) ).
cnf(c_228,plain,
( ~ h(X0_13)
| h(opp(X1_13)) ),
inference(subtyping,[status(esa)],[c_58]) ).
cnf(c_230,plain,
( ~ g(X0_14)
| product(inv(X0_14),X0_14) = eh ),
inference(subtyping,[status(esa)],[c_56]) ).
cnf(c_232,plain,
( ~ g(X0_14)
| product(X0_14,eh) = X0_14 ),
inference(subtyping,[status(esa)],[c_54]) ).
cnf(c_235,plain,
g(eh),
inference(subtyping,[status(esa)],[c_51]) ).
cnf(c_236,plain,
( ~ g(X0_14)
| g(inv(X0_14)) ),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_238,plain,
( h(opp(X0_13))
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_228]) ).
cnf(c_239,plain,
( ~ h(X0_13)
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_228]) ).
cnf(c_240,plain,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_228]) ).
cnf(c_578,plain,
product(inv(eh),eh) = eh,
inference(superposition,[status(thm)],[c_235,c_230]) ).
cnf(c_589,plain,
( ~ g(X0_14)
| product(inv(X0_14),eh) = inv(X0_14) ),
inference(superposition,[status(thm)],[c_236,c_232]) ).
cnf(c_649,plain,
product(inv(eh),eh) = inv(eh),
inference(superposition,[status(thm)],[c_235,c_589]) ).
cnf(c_652,plain,
inv(eh) = eh,
inference(demodulation,[status(thm)],[c_649,c_578]) ).
cnf(c_26208,plain,
~ sP1_iProver_split,
inference(superposition,[status(thm)],[c_227,c_239]) ).
cnf(c_26216,plain,
product(inv(eh),eh) = eh,
inference(superposition,[status(thm)],[c_235,c_230]) ).
cnf(c_26219,plain,
product(eh,eh) = eh,
inference(demodulation,[status(thm)],[c_26216,c_652]) ).
cnf(c_26284,plain,
sP0_iProver_split,
inference(superposition,[status(thm)],[c_240,c_26208]) ).
cnf(c_26288,plain,
( ~ g(X0_14)
| sum(f(X0_14),eg) = f(X0_14) ),
inference(superposition,[status(thm)],[c_221,c_224]) ).
cnf(c_26299,plain,
( ~ sP0_iProver_split
| sum(eg,opp(X0_13)) = opp(X0_13) ),
inference(superposition,[status(thm)],[c_238,c_225]) ).
cnf(c_26300,plain,
sum(eg,opp(X0_13)) = opp(X0_13),
inference(forward_subsumption_resolution,[status(thm)],[c_26299,c_26284]) ).
cnf(c_26411,plain,
( ~ g(X0_14)
| sum(opp(f(X0_14)),f(X0_14)) = eg ),
inference(superposition,[status(thm)],[c_221,c_222]) ).
cnf(c_26413,plain,
( ~ sP0_iProver_split
| sum(opp(opp(X0_13)),opp(X0_13)) = eg ),
inference(superposition,[status(thm)],[c_238,c_222]) ).
cnf(c_26416,plain,
sum(opp(opp(X0_13)),opp(X0_13)) = eg,
inference(forward_subsumption_resolution,[status(thm)],[c_26413,c_26284]) ).
cnf(c_26426,plain,
( ~ g(X0_14)
| sum(f(X0_14),opp(f(X0_14))) = eg ),
inference(superposition,[status(thm)],[c_221,c_223]) ).
cnf(c_26428,plain,
( ~ sP0_iProver_split
| sum(opp(X0_13),opp(opp(X0_13))) = eg ),
inference(superposition,[status(thm)],[c_238,c_223]) ).
cnf(c_26430,plain,
sum(opp(X0_13),opp(opp(X0_13))) = eg,
inference(forward_subsumption_resolution,[status(thm)],[c_26428,c_26284]) ).
cnf(c_26461,plain,
sum(f(eh),eg) = f(eh),
inference(superposition,[status(thm)],[c_235,c_26288]) ).
cnf(c_26462,plain,
( ~ g(X0_14)
| sum(f(inv(X0_14)),eg) = f(inv(X0_14)) ),
inference(superposition,[status(thm)],[c_236,c_26288]) ).
cnf(c_26546,plain,
sum(opp(f(eh)),f(eh)) = eg,
inference(superposition,[status(thm)],[c_235,c_26411]) ).
cnf(c_26552,plain,
sum(f(eh),opp(f(eh))) = eg,
inference(superposition,[status(thm)],[c_235,c_26426]) ).
cnf(c_32455,plain,
( ~ h(X0_13)
| ~ h(X1_13)
| ~ sP0_iProver_split
| sum(sum(X1_13,opp(X2_13)),X0_13) = sum(X1_13,sum(opp(X2_13),X0_13)) ),
inference(superposition,[status(thm)],[c_238,c_226]) ).
cnf(c_32457,plain,
( ~ h(X0_13)
| ~ h(X1_13)
| sum(sum(X1_13,opp(X2_13)),X0_13) = sum(X1_13,sum(opp(X2_13),X0_13)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_32455,c_26284]) ).
cnf(c_32849,plain,
( ~ h(X0_13)
| ~ sP0_iProver_split
| sum(sum(X0_13,opp(X1_13)),opp(X2_13)) = sum(X0_13,sum(opp(X1_13),opp(X2_13))) ),
inference(superposition,[status(thm)],[c_238,c_32457]) ).
cnf(c_32852,plain,
( ~ h(X0_13)
| sum(sum(X0_13,opp(X1_13)),opp(X2_13)) = sum(X0_13,sum(opp(X1_13),opp(X2_13))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_32849,c_26284]) ).
cnf(c_33008,plain,
( ~ g(X0_14)
| sum(sum(f(X0_14),opp(X0_13)),opp(X1_13)) = sum(f(X0_14),sum(opp(X0_13),opp(X1_13))) ),
inference(superposition,[status(thm)],[c_221,c_32852]) ).
cnf(c_33010,plain,
( ~ sP0_iProver_split
| sum(sum(opp(X0_13),opp(X1_13)),opp(X2_13)) = sum(opp(X0_13),sum(opp(X1_13),opp(X2_13))) ),
inference(superposition,[status(thm)],[c_238,c_32852]) ).
cnf(c_33012,plain,
sum(sum(opp(X0_13),opp(X1_13)),opp(X2_13)) = sum(opp(X0_13),sum(opp(X1_13),opp(X2_13))),
inference(forward_subsumption_resolution,[status(thm)],[c_33010,c_26284]) ).
cnf(c_33014,plain,
sum(opp(opp(X0_13)),sum(opp(X0_13),opp(X1_13))) = sum(eg,opp(X1_13)),
inference(superposition,[status(thm)],[c_26416,c_33012]) ).
cnf(c_33022,plain,
sum(opp(opp(X0_13)),sum(opp(X0_13),opp(X1_13))) = opp(X1_13),
inference(demodulation,[status(thm)],[c_33014,c_26300]) ).
cnf(c_33478,plain,
sum(sum(f(eh),opp(X0_13)),opp(X1_13)) = sum(f(eh),sum(opp(X0_13),opp(X1_13))),
inference(superposition,[status(thm)],[c_235,c_33008]) ).
cnf(c_33479,plain,
( ~ g(X0_14)
| sum(sum(f(inv(X0_14)),opp(X0_13)),opp(X1_13)) = sum(f(inv(X0_14)),sum(opp(X0_13),opp(X1_13))) ),
inference(superposition,[status(thm)],[c_236,c_33008]) ).
cnf(c_33594,plain,
sum(f(eh),sum(opp(f(eh)),opp(X0_13))) = sum(eg,opp(X0_13)),
inference(superposition,[status(thm)],[c_26552,c_33478]) ).
cnf(c_33601,plain,
sum(f(eh),sum(opp(f(eh)),opp(X0_13))) = opp(X0_13),
inference(demodulation,[status(thm)],[c_33594,c_26300]) ).
cnf(c_33602,plain,
sum(f(eh),eg) = opp(opp(f(eh))),
inference(superposition,[status(thm)],[c_26430,c_33601]) ).
cnf(c_33606,plain,
opp(opp(f(eh))) = f(eh),
inference(demodulation,[status(thm)],[c_33602,c_26461]) ).
cnf(c_33642,plain,
sum(opp(opp(X0_13)),sum(opp(X0_13),f(eh))) = f(eh),
inference(superposition,[status(thm)],[c_33606,c_33022]) ).
cnf(c_33719,plain,
sum(opp(f(eh)),sum(f(eh),f(eh))) = f(eh),
inference(superposition,[status(thm)],[c_33606,c_33642]) ).
cnf(c_33721,plain,
f(eh) = eg,
inference(demodulation,[status(thm)],[c_33719,c_220,c_26219,c_26546]) ).
cnf(c_33740,plain,
g(sK0),
inference(superposition,[status(thm)],[c_33721,c_218]) ).
cnf(c_33900,plain,
sum(sum(f(sK0),opp(X0_13)),opp(X1_13)) = sum(f(sK0),sum(opp(X0_13),opp(X1_13))),
inference(superposition,[status(thm)],[c_33740,c_33008]) ).
cnf(c_34789,plain,
sum(f(inv(sK0)),eg) = f(inv(sK0)),
inference(superposition,[status(thm)],[c_33740,c_26462]) ).
cnf(c_34807,plain,
sum(f(sK0),opp(f(sK0))) = eg,
inference(superposition,[status(thm)],[c_33740,c_26426]) ).
cnf(c_34821,plain,
sum(f(sK0),eg) = f(sK0),
inference(superposition,[status(thm)],[c_33740,c_26288]) ).
cnf(c_34852,plain,
product(inv(sK0),sK0) = eh,
inference(superposition,[status(thm)],[c_33740,c_230]) ).
cnf(c_57027,plain,
sum(f(sK0),sum(opp(f(sK0)),opp(X0_13))) = sum(eg,opp(X0_13)),
inference(superposition,[status(thm)],[c_34807,c_33900]) ).
cnf(c_57035,plain,
sum(f(sK0),sum(opp(f(sK0)),opp(X0_13))) = opp(X0_13),
inference(demodulation,[status(thm)],[c_57027,c_26300]) ).
cnf(c_57037,plain,
sum(f(sK0),eg) = opp(opp(f(sK0))),
inference(superposition,[status(thm)],[c_26430,c_57035]) ).
cnf(c_57043,plain,
opp(opp(f(sK0))) = f(sK0),
inference(demodulation,[status(thm)],[c_57037,c_34821]) ).
cnf(c_101931,plain,
sum(sum(f(inv(sK0)),opp(X0_13)),opp(X1_13)) = sum(f(inv(sK0)),sum(opp(X0_13),opp(X1_13))),
inference(superposition,[status(thm)],[c_33740,c_33479]) ).
cnf(c_153000,plain,
sum(sum(f(inv(sK0)),f(sK0)),opp(X0_13)) = sum(f(inv(sK0)),sum(f(sK0),opp(X0_13))),
inference(superposition,[status(thm)],[c_57043,c_101931]) ).
cnf(c_153008,plain,
sum(f(inv(sK0)),sum(f(sK0),opp(X0_13))) = opp(X0_13),
inference(demodulation,[status(thm)],[c_153000,c_220,c_26300,c_33721,c_34852]) ).
cnf(c_153009,plain,
sum(f(inv(sK0)),eg) = opp(f(sK0)),
inference(superposition,[status(thm)],[c_34807,c_153008]) ).
cnf(c_153015,plain,
opp(f(sK0)) = f(inv(sK0)),
inference(demodulation,[status(thm)],[c_153009,c_34789]) ).
cnf(c_153838,plain,
f(eh) != eg,
inference(superposition,[status(thm)],[c_153015,c_219]) ).
cnf(c_153949,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_153838,c_33721]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP776+1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 20:27:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 39.47/6.22 % SZS status Started for theBenchmark.p
% 39.47/6.22 ERROR - "ProverProcess:heur/379306:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Z3.Error("Sort mismatch at argument #1 for function (declare-fun k!97 (|16777216|) Bool) supplied sort is |16777230|")
% 39.47/6.22 Fatal error: exception Z3.Error("Sort mismatch at argument #1 for function (declare-fun k!97 (|16777216|) Bool) supplied sort is |16777230|")
% 39.47/6.22 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground false --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 "[]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;ACNormalisation]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;Demod;LightNorm;ACNormalisation]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[]" --sup_input_bw "[SubsumptionRes]" --sup_input_fw "[SMTSubs;]" --sup_input_triv "[]" --sup_iter_deepening 1 --sup_passive_queue_type priority_queues --sup_passive_queues "[[+min_def_symb;-score;+epr];[-next_state;-conj_dist;+conj_symb]]" --sup_passive_queues_freq "[3;512]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_score sim_d_gen --sup_share_max_num_cl 320 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 2.00" --time_out_real 2.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_3mqvi8f3/2j5f2dca 2>> /export/starexec/sandbox2/tmp/iprover_out_3mqvi8f3/2j5f2dca_error
% 69.22/10.24 % SZS status Theorem for theBenchmark.p
% 69.22/10.24
% 69.22/10.24 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 69.22/10.24
% 69.22/10.24 ------ iProver source info
% 69.22/10.24
% 69.22/10.24 git: date: 2023-05-31 18:12:56 +0000
% 69.22/10.24 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 69.22/10.24 git: non_committed_changes: false
% 69.22/10.24 git: last_make_outside_of_git: false
% 69.22/10.24
% 69.22/10.24 ------ Parsing...
% 69.22/10.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 69.22/10.24
% 69.22/10.24 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 69.22/10.24
% 69.22/10.24 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 69.22/10.24
% 69.22/10.24 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 69.22/10.24 ------ Proving...
% 69.22/10.24 ------ Problem Properties
% 69.22/10.24
% 69.22/10.24
% 69.22/10.24 clauses 22
% 69.22/10.24 conjectures 2
% 69.22/10.24 EPR 4
% 69.22/10.24 Horn 21
% 69.22/10.24 unary 3
% 69.22/10.24 binary 15
% 69.22/10.24 lits 47
% 69.22/10.24 lits eq 14
% 69.22/10.24 fd_pure 0
% 69.22/10.24 fd_pseudo 0
% 69.22/10.24 fd_cond 0
% 69.22/10.24 fd_pseudo_cond 0
% 69.22/10.24 AC symbols 0
% 69.22/10.24
% 69.22/10.24 ------ Input Options Time Limit: Unbounded
% 69.22/10.24
% 69.22/10.24
% 69.22/10.24 ------
% 69.22/10.24 Current options:
% 69.22/10.24 ------
% 69.22/10.24
% 69.22/10.24
% 69.22/10.24
% 69.22/10.24
% 69.22/10.24 ------ Proving...
% 69.22/10.24
% 69.22/10.24
% 69.22/10.24 % SZS status Theorem for theBenchmark.p
% 69.22/10.24
% 69.22/10.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 69.22/10.24
% 69.22/10.25
%------------------------------------------------------------------------------