TSTP Solution File: ALG074+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG074+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 185.58s 25.27s
% Output : CNFRefutation 185.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 7
% Syntax : Number of formulae : 88 ( 29 unt; 0 def)
% Number of atoms : 289 ( 115 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 329 ( 128 ~; 115 |; 53 &)
% ( 0 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn 68 !; 8 ?)
% 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] :
( ? [X1] :
( op1(op1(X0,X1),X0) != X1
& op1(op1(X0,X1),X1) = X0
& op1(X0,X1) != op1(X1,X0)
& sorti1(X1) )
& sorti1(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
~ ? [X0] :
( ? [X1] :
( op2(op2(X0,X1),X0) != X1
& op2(op2(X0,X1),X1) = X0
& op2(X0,X1) != op2(X1,X0)
& sorti2(X1) )
& sorti2(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f5,conjecture,
( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f6,negated_conjecture,
~ ( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
inference(negated_conjecture,[],[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] :
( op2(op2(X0,X1),X0) = X1
| op2(op2(X0,X1),X1) != X0
| op2(X0,X1) = op2(X1,X0)
| ~ sorti2(X1) )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f11,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(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(flattening,[],[f11]) ).
fof(f13,plain,
( ? [X0] :
( ? [X1] :
( op1(op1(X0,X1),X0) != X1
& op1(op1(X0,X1),X1) = X0
& op1(X0,X1) != op1(X1,X0)
& sorti1(X1) )
& sorti1(X0) )
=> ( ? [X1] :
( op1(op1(sK0,X1),sK0) != X1
& sK0 = op1(op1(sK0,X1),X1)
& op1(sK0,X1) != op1(X1,sK0)
& sorti1(X1) )
& sorti1(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ? [X1] :
( op1(op1(sK0,X1),sK0) != X1
& sK0 = op1(op1(sK0,X1),X1)
& op1(sK0,X1) != op1(X1,sK0)
& sorti1(X1) )
=> ( sK1 != op1(op1(sK0,sK1),sK0)
& sK0 = op1(op1(sK0,sK1),sK1)
& op1(sK0,sK1) != op1(sK1,sK0)
& sorti1(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( sK1 != op1(op1(sK0,sK1),sK0)
& sK0 = op1(op1(sK0,sK1),sK1)
& op1(sK0,sK1) != op1(sK1,sK0)
& sorti1(sK1)
& sorti1(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f3,f14,f13]) ).
fof(f16,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,[],[f12]) ).
fof(f17,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0,X1] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
op1(sK0,sK1) != op1(sK1,sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
sK0 = op1(op1(sK0,sK1),sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
sK1 != op1(op1(sK0,sK1),sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( op2(op2(X0,X1),X0) = X1
| op2(op2(X0,X1),X1) != X0
| op2(X0,X1) = op2(X1,X0)
| ~ sorti2(X1)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f25,plain,
! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
! [X4,X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5)
| ~ sorti1(X4) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
( ~ sorti1(X0)
| ~ sorti1(X1)
| sorti1(op1(X0,X1)) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_50,plain,
( ~ sorti2(X0)
| ~ sorti2(X1)
| sorti2(op2(X0,X1)) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_51,plain,
op1(op1(sK0,sK1),sK0) != sK1,
inference(cnf_transformation,[],[f23]) ).
cnf(c_52,plain,
op1(op1(sK0,sK1),sK1) = sK0,
inference(cnf_transformation,[],[f22]) ).
cnf(c_53,plain,
op1(sK1,sK0) != op1(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
cnf(c_54,plain,
sorti1(sK1),
inference(cnf_transformation,[],[f20]) ).
cnf(c_55,plain,
sorti1(sK0),
inference(cnf_transformation,[],[f19]) ).
cnf(c_56,plain,
( op2(op2(X0,X1),X1) != X0
| ~ sorti2(X0)
| ~ sorti2(X1)
| op2(op2(X0,X1),X0) = X1
| op2(X0,X1) = op2(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,negated_conjecture,
( ~ sorti1(X0)
| j(h(X0)) = X0 ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_60,negated_conjecture,
( ~ sorti1(X0)
| ~ sorti1(X1)
| op2(h(X0),h(X1)) = h(op1(X0,X1)) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_62,negated_conjecture,
( ~ sorti1(X0)
| sorti2(h(X0)) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_140,negated_conjecture,
( ~ sorti1(X0_13)
| sorti2(h(X0_13)) ),
inference(subtyping,[status(esa)],[c_62]) ).
cnf(c_142,negated_conjecture,
( ~ sorti1(X0_13)
| ~ sorti1(X1_13)
| op2(h(X0_13),h(X1_13)) = h(op1(X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_60]) ).
cnf(c_145,negated_conjecture,
( ~ sorti1(X0_13)
| j(h(X0_13)) = X0_13 ),
inference(subtyping,[status(esa)],[c_57]) ).
cnf(c_146,plain,
( op2(op2(X0_14,X1_14),X1_14) != X0_14
| ~ sorti2(X0_14)
| ~ sorti2(X1_14)
| op2(op2(X0_14,X1_14),X0_14) = X1_14
| op2(X0_14,X1_14) = op2(X1_14,X0_14) ),
inference(subtyping,[status(esa)],[c_56]) ).
cnf(c_147,plain,
sorti1(sK0),
inference(subtyping,[status(esa)],[c_55]) ).
cnf(c_148,plain,
sorti1(sK1),
inference(subtyping,[status(esa)],[c_54]) ).
cnf(c_149,plain,
op1(sK1,sK0) != op1(sK0,sK1),
inference(subtyping,[status(esa)],[c_53]) ).
cnf(c_150,plain,
op1(op1(sK0,sK1),sK1) = sK0,
inference(subtyping,[status(esa)],[c_52]) ).
cnf(c_151,plain,
op1(op1(sK0,sK1),sK0) != sK1,
inference(subtyping,[status(esa)],[c_51]) ).
cnf(c_152,plain,
( ~ sorti2(X0_14)
| ~ sorti2(X1_14)
| sorti2(op2(X0_14,X1_14)) ),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_153,plain,
( ~ sorti1(X0_13)
| ~ sorti1(X1_13)
| sorti1(op1(X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_49]) ).
cnf(c_412,plain,
( ~ sorti1(X0_13)
| op2(h(sK0),h(X0_13)) = h(op1(sK0,X0_13)) ),
inference(superposition,[status(thm)],[c_147,c_142]) ).
cnf(c_418,plain,
( ~ sorti1(X0_13)
| op2(h(sK1),h(X0_13)) = h(op1(sK1,X0_13)) ),
inference(superposition,[status(thm)],[c_148,c_142]) ).
cnf(c_419,plain,
j(h(sK1)) = sK1,
inference(superposition,[status(thm)],[c_148,c_145]) ).
cnf(c_435,plain,
op2(h(sK0),h(sK1)) = h(op1(sK0,sK1)),
inference(superposition,[status(thm)],[c_148,c_412]) ).
cnf(c_442,plain,
op2(h(sK1),h(sK0)) = h(op1(sK1,sK0)),
inference(superposition,[status(thm)],[c_147,c_418]) ).
cnf(c_478,plain,
( ~ sorti1(X0_13)
| ~ sorti1(X1_13)
| ~ sorti1(X2_13)
| op2(h(op1(X0_13,X1_13)),h(X2_13)) = h(op1(op1(X0_13,X1_13),X2_13)) ),
inference(superposition,[status(thm)],[c_153,c_142]) ).
cnf(c_479,plain,
( ~ sorti1(X0_13)
| ~ sorti1(X1_13)
| j(h(op1(X0_13,X1_13))) = op1(X0_13,X1_13) ),
inference(superposition,[status(thm)],[c_153,c_145]) ).
cnf(c_540,plain,
( ~ sorti1(X0_13)
| j(h(op1(sK1,X0_13))) = op1(sK1,X0_13) ),
inference(superposition,[status(thm)],[c_148,c_479]) ).
cnf(c_541,plain,
( ~ sorti1(X0_13)
| j(h(op1(sK0,X0_13))) = op1(sK0,X0_13) ),
inference(superposition,[status(thm)],[c_147,c_479]) ).
cnf(c_543,plain,
( ~ sorti1(X0_13)
| ~ sorti1(X1_13)
| ~ sorti1(X2_13)
| j(h(op1(op1(X0_13,X1_13),X2_13))) = op1(op1(X0_13,X1_13),X2_13) ),
inference(superposition,[status(thm)],[c_153,c_479]) ).
cnf(c_575,plain,
( op2(h(op1(sK0,sK1)),h(sK1)) != h(sK0)
| ~ sorti2(h(sK1))
| ~ sorti2(h(sK0))
| op2(op2(h(sK0),h(sK1)),h(sK0)) = h(sK1)
| op2(h(sK1),h(sK0)) = op2(h(sK0),h(sK1)) ),
inference(superposition,[status(thm)],[c_435,c_146]) ).
cnf(c_577,plain,
( op2(h(op1(sK0,sK1)),h(sK1)) != h(sK0)
| ~ sorti2(h(sK1))
| ~ sorti2(h(sK0))
| op2(h(op1(sK0,sK1)),h(sK0)) = h(sK1)
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(demodulation,[status(thm)],[c_575,c_435,c_442]) ).
cnf(c_1130,plain,
j(h(op1(sK1,sK0))) = op1(sK1,sK0),
inference(superposition,[status(thm)],[c_147,c_540]) ).
cnf(c_1368,plain,
j(h(op1(sK0,sK1))) = op1(sK0,sK1),
inference(superposition,[status(thm)],[c_148,c_541]) ).
cnf(c_2580,plain,
( ~ sorti1(X0_13)
| ~ sorti1(X1_13)
| op2(h(op1(sK0,X0_13)),h(X1_13)) = h(op1(op1(sK0,X0_13),X1_13)) ),
inference(superposition,[status(thm)],[c_147,c_478]) ).
cnf(c_3372,plain,
( ~ sorti1(X0_13)
| ~ sorti1(X1_13)
| j(h(op1(op1(sK0,X0_13),X1_13))) = op1(op1(sK0,X0_13),X1_13) ),
inference(superposition,[status(thm)],[c_147,c_543]) ).
cnf(c_16187,plain,
( ~ sorti1(X0_13)
| j(h(op1(op1(sK0,sK1),X0_13))) = op1(op1(sK0,sK1),X0_13) ),
inference(superposition,[status(thm)],[c_148,c_3372]) ).
cnf(c_16196,plain,
j(h(op1(op1(sK0,sK1),sK0))) = op1(op1(sK0,sK1),sK0),
inference(superposition,[status(thm)],[c_147,c_16187]) ).
cnf(c_27419,plain,
( ~ sorti1(X0_13)
| op2(h(op1(sK0,sK1)),h(X0_13)) = h(op1(op1(sK0,sK1),X0_13)) ),
inference(superposition,[status(thm)],[c_148,c_2580]) ).
cnf(c_27458,plain,
op2(h(op1(sK0,sK1)),h(sK1)) = h(op1(op1(sK0,sK1),sK1)),
inference(superposition,[status(thm)],[c_148,c_27419]) ).
cnf(c_27459,plain,
op2(h(op1(sK0,sK1)),h(sK0)) = h(op1(op1(sK0,sK1),sK0)),
inference(superposition,[status(thm)],[c_147,c_27419]) ).
cnf(c_27466,plain,
op2(h(op1(sK0,sK1)),h(sK1)) = h(sK0),
inference(demodulation,[status(thm)],[c_27458,c_150]) ).
cnf(c_27467,plain,
( ~ sorti2(h(sK1))
| ~ sorti2(h(sK0))
| op2(h(op1(sK0,sK1)),h(sK0)) = h(sK1)
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_577,c_27466]) ).
cnf(c_27847,plain,
( ~ sorti2(h(op1(sK0,sK1)))
| ~ sorti2(h(sK1))
| sorti2(h(sK0)) ),
inference(superposition,[status(thm)],[c_27466,c_152]) ).
cnf(c_27854,plain,
( ~ sorti1(op1(sK0,sK1))
| ~ sorti2(h(sK1))
| sorti2(h(sK0)) ),
inference(superposition,[status(thm)],[c_140,c_27847]) ).
cnf(c_27872,plain,
( ~ sorti2(h(sK1))
| ~ sorti1(sK1)
| ~ sorti1(sK0)
| sorti2(h(sK0)) ),
inference(superposition,[status(thm)],[c_153,c_27854]) ).
cnf(c_27873,plain,
( ~ sorti2(h(sK1))
| sorti2(h(sK0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_27872,c_147,c_148]) ).
cnf(c_27874,plain,
( ~ sorti1(sK1)
| sorti2(h(sK0)) ),
inference(superposition,[status(thm)],[c_140,c_27873]) ).
cnf(c_27875,plain,
sorti2(h(sK0)),
inference(forward_subsumption_resolution,[status(thm)],[c_27874,c_148]) ).
cnf(c_27888,plain,
( ~ sorti2(h(sK1))
| op2(h(op1(sK0,sK1)),h(sK0)) = h(sK1)
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_27467,c_27875]) ).
cnf(c_29170,plain,
( ~ sorti2(h(sK1))
| h(op1(op1(sK0,sK1),sK0)) = h(sK1)
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(demodulation,[status(thm)],[c_27888,c_27459]) ).
cnf(c_84608,plain,
( ~ sorti1(sK1)
| h(op1(op1(sK0,sK1),sK0)) = h(sK1)
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(superposition,[status(thm)],[c_140,c_29170]) ).
cnf(c_84609,plain,
( h(op1(op1(sK0,sK1),sK0)) = h(sK1)
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_84608,c_148]) ).
cnf(c_84613,plain,
( op1(op1(sK0,sK1),sK0) = j(h(sK1))
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(superposition,[status(thm)],[c_84609,c_16196]) ).
cnf(c_84614,plain,
( op1(op1(sK0,sK1),sK0) = sK1
| h(op1(sK1,sK0)) = h(op1(sK0,sK1)) ),
inference(demodulation,[status(thm)],[c_84613,c_419]) ).
cnf(c_84615,plain,
h(op1(sK1,sK0)) = h(op1(sK0,sK1)),
inference(forward_subsumption_resolution,[status(thm)],[c_84614,c_151]) ).
cnf(c_84649,plain,
j(h(op1(sK1,sK0))) = op1(sK0,sK1),
inference(demodulation,[status(thm)],[c_1368,c_84615]) ).
cnf(c_84651,plain,
op1(sK1,sK0) = op1(sK0,sK1),
inference(demodulation,[status(thm)],[c_84649,c_1130]) ).
cnf(c_84652,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_84651,c_149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ALG074+1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n012.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 22:45:10 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 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
% 37.67/6.19 % SZS status Started for theBenchmark.p
% 37.67/6.19 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 |16777229|")
% 37.67/6.19 Fatal error: exception Z3.Error("Sort mismatch at argument #1 for function (declare-fun k!97 (|16777216|) Bool) supplied sort is |16777229|")
% 37.67/6.19 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 --suppress_sat_res true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 2.00" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_60wsm2m3/wxx0yww2 2>> /export/starexec/sandbox/tmp/iprover_out_60wsm2m3/wxx0yww2_error
% 185.58/25.27 % SZS status Theorem for theBenchmark.p
% 185.58/25.27
% 185.58/25.27 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 185.58/25.27
% 185.58/25.27 ------ iProver source info
% 185.58/25.27
% 185.58/25.27 git: date: 2024-05-02 19:28:25 +0000
% 185.58/25.27 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 185.58/25.27 git: non_committed_changes: false
% 185.58/25.27
% 185.58/25.27 ------ Parsing...
% 185.58/25.27 ------ Clausification by vclausify_rel & Parsing by iProver...
% 185.58/25.27
% 185.58/25.27 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 185.58/25.27
% 185.58/25.27 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 185.58/25.27
% 185.58/25.27 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 185.58/25.27 ------ Proving...
% 185.58/25.27 ------ Problem Properties
% 185.58/25.27
% 185.58/25.27
% 185.58/25.27 clauses 14
% 185.58/25.27 conjectures 6
% 185.58/25.27 EPR 2
% 185.58/25.27 Horn 13
% 185.58/25.27 unary 5
% 185.58/25.27 binary 4
% 185.58/25.27 lits 30
% 185.58/25.27 lits eq 10
% 185.58/25.27 fd_pure 0
% 185.58/25.27 fd_pseudo 0
% 185.58/25.27 fd_cond 0
% 185.58/25.27 fd_pseudo_cond 0
% 185.58/25.27 AC symbols 0
% 185.58/25.27
% 185.58/25.27 ------ Input Options Time Limit: Unbounded
% 185.58/25.27
% 185.58/25.27
% 185.58/25.27 ------
% 185.58/25.27 Current options:
% 185.58/25.27 ------
% 185.58/25.27
% 185.58/25.27
% 185.58/25.27
% 185.58/25.27
% 185.58/25.27 ------ Proving...
% 185.58/25.27
% 185.58/25.27
% 185.58/25.27 % SZS status Theorem for theBenchmark.p
% 185.58/25.27
% 185.58/25.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 185.58/25.27
% 185.58/25.28
%------------------------------------------------------------------------------