TSTP Solution File: SWW639_2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWW639_2 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 : 600s
% DateTime : Thu Jul 21 01:25:31 EDT 2022
% Result : Theorem 11.12s 11.34s
% Output : Refutation 11.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$LESSEQ')
% Comments :
%------------------------------------------------------------------------------
cnf('$$LESSEQ-IS-REFLEXIVE',axiom,
$lesseq(X,X) ).
tff('SOLVE-$$LESS-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( $less(X,Y)
| ~ '$$$LESS'(X,Y) ) ).
tff('SOLVE-$$LESSEQ-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( $lesseq(X,Y)
| '$$$LESS'(Y,X) ) ).
tff(35,axiom,
! [X: ty,Y: uni,Z: uni,U: uni,V: ty,W: uni] :
( ~ sort1(X,Y)
| ( Z != U )
| ( get(X,V,set(X,V,W,Z,Y),U) = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',select_eq) ).
tff(37,axiom,
! [X: ty,Y: ty,Z: uni] : sort1(map(X,Y),const(Y,X,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',const_sort1) ).
tff(40,axiom,
! [X: ty,Y: $int,Z: uni] : ( length2(X,mk_array1(X,Y,Z)) = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',length_def2) ).
tff(42,axiom,
! [X: ty,Y: uni,Z: $int] :
( ~ sort1(map(int,X),Y)
| ( elts(X,mk_array1(X,Z,Y)) = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',elts_def1) ).
tff(45,axiom,
! [X: $int] : sort1(int,t2tb(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2tb_sort) ).
tff(46,axiom,
! [X: $int] : ( tb2t(t2tb(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeL) ).
tff(47,axiom,
! [X: uni] : ( t2tb(tb2t(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR) ).
tff(52,axiom,
! [X: ty,Y: $int,Z: uni] : ( make2(X,Y,Z) = mk_array1(X,Y,const(X,int,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',make_def) ).
tff(55,axiom,
! [X: ty,Y: uni,Z: $int,U: uni] :
( ~ sort1(X,Y)
| ( dummy(X,mk_rarray1(X,Y,Z,U)) = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dummy_def1) ).
tff(56,axiom,
! [X: ty,Y: uni,Z: $int,U: uni] : ( length3(X,mk_rarray1(X,Y,Z,U)) = Z ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',length_def3) ).
tff(58,axiom,
! [X: ty,Y: uni,Z: $int,U: uni] : ( data(X,mk_rarray1(X,Y,Z,U)) = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',data_def1) ).
tff(65,axiom,
! [X: ty,Y: $int,Z: uni] : ( make3(X,Y,Z) = mk_rarray1(X,Z,Y,make2(X,Y,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',make_def1) ).
tff(66,axiom,
! [X: map_int_int] : sort1(map(int,int),t2tb1(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2tb_sort1) ).
tff(68,axiom,
! [X: uni] : ( t2tb1(tb2t1(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR1) ).
tff(71,axiom,
! [X: uni] : ( t2tb2(tb2t2(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR2) ).
tff(74,axiom,
! [X: uni] : ( t2tb3(tb2t3(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR3) ).
tff(91,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t3(make3(int,10,t2tb(0))) = tb2t3(mk_rarray1(int,t2tb('SKOLEMAAAV8.$int'),'SKOLEMAAAV9.$int',t2tb2('SKOLEMAAAV10.array_int'))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(92,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t3(make3(int,10,t2tb(0))) = tb2t3(mk_rarray1(int,t2tb('SKOLEMAAAV8.$int'),'SKOLEMAAAV9.$int',t2tb2('SKOLEMAAAV10.array_int'))) ) ),
inference('REWRITE',[status(thm)],[91,'CODE-FOR-$$LESSEQ']) ).
tff(93,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t(dummy(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV8.$int' ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(94,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t(dummy(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV8.$int' ) ),
inference('REWRITE',[status(thm)],[93,'CODE-FOR-$$LESSEQ']) ).
tff(95,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( length3(int,make3(int,10,t2tb(0))) = 'SKOLEMAAAV9.$int' ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(96,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( length3(int,make3(int,10,t2tb(0))) = 'SKOLEMAAAV9.$int' ) ),
inference('REWRITE',[status(thm)],[95,'CODE-FOR-$$LESSEQ']) ).
tff(97,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( 'SKOLEMAAAV10.array_int' = tb2t2(mk_array1(int,'SKOLEMAAAV11.$int',t2tb1('SKOLEMAAAV12.map_int_int'))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(98,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( 'SKOLEMAAAV10.array_int' = tb2t2(mk_array1(int,'SKOLEMAAAV11.$int',t2tb1('SKOLEMAAAV12.map_int_int'))) ) ),
inference('REWRITE',[status(thm)],[97,'CODE-FOR-$$LESSEQ']) ).
tff(99,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( length2(int,data(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV11.$int' ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(100,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( length2(int,data(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV11.$int' ) ),
inference('REWRITE',[status(thm)],[99,'CODE-FOR-$$LESSEQ']) ).
tff(101,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t1(set(int,int,elts(int,data(int,make3(int,10,t2tb(0)))),t2tb(0),t2tb(17))) = 'SKOLEMAAAV4.map_int_int' ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(102,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t1(set(int,int,elts(int,data(int,make3(int,10,t2tb(0)))),t2tb(0),t2tb(17))) = 'SKOLEMAAAV4.map_int_int' ) ),
inference('REWRITE',[status(thm)],[101,'CODE-FOR-$$LESSEQ']) ).
tff(116,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t(dummy(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV20.$int' ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(117,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t(dummy(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV20.$int' ) ),
inference('REWRITE',[status(thm)],[116,'CODE-FOR-$$LESSEQ']) ).
tff(124,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t1(set(int,int,elts(int,data(int,make3(int,10,t2tb(0)))),t2tb(0),t2tb(42))) = 'SKOLEMAAAV16.map_int_int' ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(125,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( tb2t1(set(int,int,elts(int,data(int,make3(int,10,t2tb(0)))),t2tb(0),t2tb(42))) = 'SKOLEMAAAV16.map_int_int' ) ),
inference('REWRITE',[status(thm)],[124,'CODE-FOR-$$LESSEQ']) ).
tff(136,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( 'SKOLEMAAAV27.$int' = $sum(length3(int,make3(int,10,t2tb(0))),length3(int,make3(int,10,t2tb(0)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(137,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( 'SKOLEMAAAV27.$int' = $product(2,length3(int,make3(int,10,t2tb(0)))) ) ),
inference('REWRITE',[status(thm)],[136,'CODE-FOR-$$SUM','CODE-FOR-$$LESSEQ']) ).
tff(138,negated_conjecture,
! [X: $int] :
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ~ $lesseq(0,X)
| ~ $less(X,'SKOLEMAAAV27.$int')
| ~ $less(X,length3(int,make3(int,10,t2tb(0))))
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(X))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV4.map_int_int'),t2tb(X))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(139,plain,
! [X: $int] :
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ~ $lesseq(0,X)
| ~ $less(X,'SKOLEMAAAV27.$int')
| ~ $less(X,length3(int,make3(int,10,t2tb(0))))
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(X))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV4.map_int_int'),t2tb(X))) ) ),
inference('REWRITE',[status(thm)],[138,'CODE-FOR-$$LESSEQ']) ).
tff(140,negated_conjecture,
! [X: $int] :
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ~ $lesseq(0,X)
| ~ $less(X,'SKOLEMAAAV27.$int')
| ~ $lesseq(length3(int,make3(int,10,t2tb(0))),X)
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(X))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb($difference(X,length3(int,make3(int,10,t2tb(0))))))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(141,plain,
! [X: $int] :
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ~ $lesseq(0,X)
| ~ $less(X,'SKOLEMAAAV27.$int')
| ~ $lesseq(length3(int,make3(int,10,t2tb(0))),X)
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(X))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb($sum(X,$product(-1,length3(int,make3(int,10,t2tb(0)))))))) ) ),
inference('REWRITE',[status(thm)],[140,'CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE','CODE-FOR-$$LESSEQ']) ).
tff(142,negated_conjecture,
( ~ $lesseq(0,10)
| ~ $lesseq(0,0)
| ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( 'SKOLEMAAAV27.$int' != 20 )
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(0))) != 17 )
| ~ $less(10,'SKOLEMAAAV27.$int')
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(10))) != 42 )
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb(0))) != 42 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_test2) ).
tff(143,plain,
( ~ $less(0,length3(int,make3(int,10,t2tb(0))))
| ( 'SKOLEMAAAV27.$int' != 20 )
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(0))) != 17 )
| ~ $less(10,'SKOLEMAAAV27.$int')
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(10))) != 42 )
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb(0))) != 42 ) ),
inference('REWRITE',[status(thm)],[142,'CODE-FOR-$$LESSEQ']) ).
tff(150,plain,
! [X: uni] : sort1(int,X),
inference('PARAMODULATE',[status(thm)],[45,47,theory(equality)]) ).
tff(151,plain,
! [X: uni] : sort1(map(int,int),X),
inference('PARAMODULATE',[status(thm)],[66,68,theory(equality)]) ).
tff(216,plain,
! [X: ty,Y: $int,Z: uni] : ( length2(X,make2(X,Y,Z)) = Y ),
inference('PARAMODULATE',[status(thm)],[40,52,theory(equality)]) ).
tff(231,plain,
! [X: ty,Y: $int,Z: uni] : ( length3(X,make3(X,Y,Z)) = Y ),
inference('PARAMODULATE',[status(thm)],[56,65,theory(equality)]) ).
tff(237,plain,
tb2t3(make3(int,10,t2tb(0))) = tb2t3(mk_rarray1(int,t2tb('SKOLEMAAAV8.$int'),'SKOLEMAAAV9.$int',t2tb2('SKOLEMAAAV10.array_int'))),
inference('REWRITE',[status(thm)],[92,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(238,plain,
tb2t(dummy(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV8.$int',
inference('REWRITE',[status(thm)],[94,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(241,plain,
10 = 'SKOLEMAAAV9.$int',
inference('REWRITE',[status(thm)],[96,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(242,plain,
tb2t3(make3(int,10,t2tb(0))) = tb2t3(mk_rarray1(int,t2tb('SKOLEMAAAV8.$int'),10,t2tb2('SKOLEMAAAV10.array_int'))),
inference('REWRITE',[status(thm)],[237,241,theory(equality)]) ).
tff(243,plain,
'SKOLEMAAAV10.array_int' = tb2t2(mk_array1(int,'SKOLEMAAAV11.$int',t2tb1('SKOLEMAAAV12.map_int_int'))),
inference('REWRITE',[status(thm)],[98,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(244,plain,
length2(int,data(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV11.$int',
inference('REWRITE',[status(thm)],[100,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(248,plain,
tb2t1(set(int,int,elts(int,data(int,make3(int,10,t2tb(0)))),t2tb(0),t2tb(17))) = 'SKOLEMAAAV4.map_int_int',
inference('REWRITE',[status(thm)],[102,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(255,plain,
'SKOLEMAAAV8.$int' = 'SKOLEMAAAV20.$int',
inference('REWRITE',[status(thm)],[117,238,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(256,plain,
tb2t(dummy(int,make3(int,10,t2tb(0)))) = 'SKOLEMAAAV20.$int',
inference('REWRITE',[status(thm)],[238,255,theory(equality)]) ).
tff(257,plain,
tb2t3(make3(int,10,t2tb(0))) = tb2t3(mk_rarray1(int,t2tb('SKOLEMAAAV20.$int'),10,t2tb2('SKOLEMAAAV10.array_int'))),
inference('REWRITE',[status(thm)],[242,255,theory(equality)]) ).
tff(266,plain,
tb2t1(set(int,int,elts(int,data(int,make3(int,10,t2tb(0)))),t2tb(0),t2tb(42))) = 'SKOLEMAAAV16.map_int_int',
inference('REWRITE',[status(thm)],[125,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(272,plain,
'SKOLEMAAAV27.$int' = 20,
inference('REWRITE',[status(thm)],[137,'CODE-FOR-$$PRODUCT','CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(275,plain,
! [X: $int] :
( ~ $lesseq(0,X)
| ~ $less(X,20)
| ~ $less(X,10)
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(X))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV4.map_int_int'),t2tb(X))) ) ),
inference('REWRITE',[status(thm)],[139,272,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(276,plain,
! [X: $int] :
( ~ $lesseq(0,X)
| ~ $less(X,20)
| ~ $lesseq(10,X)
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(X))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb($sum(-10,X)))) ) ),
inference('REWRITE',[status(thm)],[141,'CODE-FOR-$$SUM','CODE-FOR-$$PRODUCT',272,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(277,plain,
( ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(0))) != 17 )
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(10))) != 42 )
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb(0))) != 42 ) ),
inference('REWRITE',[status(thm)],[143,272,'CODE-FOR-$$LESS',231,theory(equality)]) ).
tff(282,plain,
! [X: ty,Y: $int,Z: uni] : ( data(X,make3(X,Y,Z)) = make2(X,Y,Z) ),
inference('PARAMODULATE',[status(thm)],[58,65,theory(equality)]) ).
tff(283,plain,
10 = 'SKOLEMAAAV11.$int',
inference('REWRITE',[status(thm)],[244,216,282,theory(equality)]) ).
tff(284,plain,
'SKOLEMAAAV10.array_int' = tb2t2(mk_array1(int,10,t2tb1('SKOLEMAAAV12.map_int_int'))),
inference('REWRITE',[status(thm)],[243,283,theory(equality)]) ).
tff(289,plain,
tb2t1(set(int,int,elts(int,make2(int,10,t2tb(0))),t2tb(0),t2tb(17))) = 'SKOLEMAAAV4.map_int_int',
inference('REWRITE',[status(thm)],[248,282,theory(equality)]) ).
tff(291,plain,
tb2t1(set(int,int,elts(int,make2(int,10,t2tb(0))),t2tb(0),t2tb(42))) = 'SKOLEMAAAV16.map_int_int',
inference('REWRITE',[status(thm)],[266,282,theory(equality)]) ).
tff(317,plain,
t2tb2('SKOLEMAAAV10.array_int') = mk_array1(int,10,t2tb1('SKOLEMAAAV12.map_int_int')),
inference('PARAMODULATE',[status(thm)],[71,284,theory(equality)]) ).
tff(319,plain,
t2tb('SKOLEMAAAV20.$int') = dummy(int,make3(int,10,t2tb(0))),
inference('PARAMODULATE',[status(thm)],[47,256,theory(equality)]) ).
tff(407,plain,
! [X: ty,Y: $int,Z: uni] : ( elts(X,make2(X,Y,Z)) = const(X,int,Z) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[42,37]),52,theory(equality)]) ).
tff(408,plain,
tb2t1(set(int,int,const(int,int,t2tb(0)),t2tb(0),t2tb(17))) = 'SKOLEMAAAV4.map_int_int',
inference('REWRITE',[status(thm)],[289,407,theory(equality)]) ).
tff(409,plain,
tb2t1(set(int,int,const(int,int,t2tb(0)),t2tb(0),t2tb(42))) = 'SKOLEMAAAV16.map_int_int',
inference('REWRITE',[status(thm)],[291,407,theory(equality)]) ).
tff(420,plain,
make3(int,10,t2tb(0)) = mk_rarray1(int,t2tb('SKOLEMAAAV20.$int'),10,t2tb2('SKOLEMAAAV10.array_int')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[74,257,theory(equality)]),74,theory(equality)]) ).
tff(423,plain,
t2tb1('SKOLEMAAAV4.map_int_int') = set(int,int,const(int,int,t2tb(0)),t2tb(0),t2tb(17)),
inference('PARAMODULATE',[status(thm)],[68,408,theory(equality)]) ).
tff(424,plain,
t2tb1('SKOLEMAAAV16.map_int_int') = set(int,int,const(int,int,t2tb(0)),t2tb(0),t2tb(42)),
inference('PARAMODULATE',[status(thm)],[68,409,theory(equality)]) ).
tff(512,plain,
tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(0))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV4.map_int_int'),t2tb(0))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[275,'$$LESSEQ-IS-REFLEXIVE','SOLVE-$$LESS-BY-$$$LESS','SOLVE-$$LESS-BY-$$$LESS']),'CODE-FOR-$$$LESS']) ).
tff(520,plain,
tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(10))) = tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb(0))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[276,'SOLVE-$$LESSEQ-BY-$$$LESS','SOLVE-$$LESS-BY-$$$LESS','$$LESSEQ-IS-REFLEXIVE']),'CODE-FOR-$$SUM','CODE-FOR-$$$LESS']) ).
tff(521,plain,
( ( tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(0))) != 17 )
| ( tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb(0))) != 42 ) ),
inference('REWRITE',[status(thm)],[277,520,theory(equality)]) ).
tff(533,plain,
! [X: uni,Y: $int,Z: uni] : ( dummy(int,mk_rarray1(int,X,Y,Z)) = X ),
inference('HYPERRESOLVE',[status(thm)],[55,150]) ).
tff(535,plain,
! [X: ty,Y: uni,Z: uni,U: uni] : ( get(int,X,set(int,X,Y,Z,U),Z) = U ),
inference('HYPERRESOLVE',[status(thm)],[35,150,theory(equality)]) ).
tff(549,plain,
! [X: $int,Y: uni] : ( elts(int,mk_array1(int,X,Y)) = Y ),
inference('HYPERRESOLVE',[status(thm)],[42,151]) ).
tff(1279,plain,
elts(int,t2tb2('SKOLEMAAAV10.array_int')) = t2tb1('SKOLEMAAAV12.map_int_int'),
inference('PARAMODULATE',[status(thm)],[549,317,theory(equality)]) ).
tff(1370,plain,
! [X: $int,Y: uni] : ( dummy(int,make3(int,X,Y)) = Y ),
inference('PARAMODULATE',[status(thm)],[533,65,theory(equality)]) ).
tff(1371,plain,
t2tb('SKOLEMAAAV20.$int') = t2tb(0),
inference('REWRITE',[status(thm)],[319,1370,theory(equality)]) ).
tff(1372,plain,
make3(int,10,t2tb(0)) = mk_rarray1(int,t2tb(0),10,t2tb2('SKOLEMAAAV10.array_int')),
inference('REWRITE',[status(thm)],[420,1371,theory(equality)]) ).
tff(7835,plain,
make2(int,10,t2tb(0)) = t2tb2('SKOLEMAAAV10.array_int'),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[58,1372,theory(equality)]),282,theory(equality)]) ).
tff(7839,plain,
t2tb1('SKOLEMAAAV12.map_int_int') = const(int,int,t2tb(0)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[407,7835,theory(equality)]),1279,theory(equality)]) ).
tff(7840,plain,
t2tb1('SKOLEMAAAV4.map_int_int') = set(int,int,t2tb1('SKOLEMAAAV12.map_int_int'),t2tb(0),t2tb(17)),
inference('REWRITE',[status(thm)],[423,7839,theory(equality)]) ).
tff(7841,plain,
t2tb1('SKOLEMAAAV16.map_int_int') = set(int,int,t2tb1('SKOLEMAAAV12.map_int_int'),t2tb(0),t2tb(42)),
inference('REWRITE',[status(thm)],[424,7839,theory(equality)]) ).
tff(7845,plain,
get(int,int,t2tb1('SKOLEMAAAV4.map_int_int'),t2tb(0)) = t2tb(17),
inference('PARAMODULATE',[status(thm)],[535,7840,theory(equality)]) ).
tff(7846,plain,
tb2t(get(int,int,t2tb1('SKOLEMAAAV26.map_int_int'),t2tb(0))) = 17,
inference('REWRITE',[status(thm)],[512,46,7845,theory(equality)]) ).
tff(7847,plain,
tb2t(get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb(0))) != 42,
inference('REWRITE',[status(thm)],[521,7846,theory(equality)]) ).
tff(7849,plain,
get(int,int,t2tb1('SKOLEMAAAV16.map_int_int'),t2tb(0)) = t2tb(42),
inference('PARAMODULATE',[status(thm)],[535,7841,theory(equality)]) ).
cnf(7851,plain,
$false,
inference('REWRITE',[status(thm)],[7847,46,7849,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW639_2 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 5 10:15:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-05T10:15:04
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-05T10:15:04
% 0.19/0.52 WARNING: Cannot use equality or equivalence (= ?X.tuple02 tuple03) as rewrite.
% 11.12/11.34
% 11.12/11.34
% 11.12/11.34 #||
% 11.12/11.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.12/11.34 % SZS output start Refutation
% See solution above
% 11.12/11.34 ||#
% 11.12/11.34
% 11.12/11.34 ; Summary of computation:
% 11.12/11.34 ; 35980 formulas have been input or derived (from 479 formulas).
% 11.12/11.34 ; 7851 (22%) were retained. Of these,
% 11.12/11.34 ; 186 ( 2%) were simplified or subsumed later,
% 11.12/11.34 ; 7665 (98%) are still being kept.
% 11.12/11.34 ;
% 11.12/11.34 ; Run time in seconds excluding printing time:
% 11.12/11.34 ; 0.028 0% Read assertion file (1 call)
% 11.12/11.34 ; 0.005 0% Assert (61 calls)
% 11.12/11.34 ; 1.026 9% Process new row (34,950 calls)
% 11.12/11.34 ; 0.769 7% Resolution (956 calls)
% 11.12/11.34 ; 0.092 1% Paramodulation (478 calls)
% 11.12/11.34 ; 0.001 0% Factoring (71 calls)
% 11.12/11.34 ; 0.126 1% Condensing (7,285 calls)
% 11.12/11.34 ; 0.813 7% Forward subsumption (7,285 calls)
% 11.12/11.34 ; 0.219 2% Backward subsumption (4,031 calls)
% 11.12/11.34 ; 0.238 2% Clause clause subsumption (46,809 calls)
% 11.12/11.34 ; 6.859 63% Forward simplification (34,600 calls)
% 11.12/11.34 ; 0.264 2% Backward simplification (7,816 calls)
% 11.12/11.34 ; 0.024 0% Ordering (12,156 calls)
% 11.12/11.34 ; 0.000 0% Ordering ac (4 calls)
% 11.12/11.34 ; 0.251 2% Sortal reasoning (325,560 calls)
% 11.12/11.34 ; 0.000 0% Purity testing (1 call)
% 11.12/11.34 ; 0.145 1% Other
% 11.12/11.34 ; 10.860 Total
% 11.12/11.34 ; 10.872 Real time
% 11.12/11.35 ;
% 11.12/11.35 ; Term-hash-array has 13,118 terms in all.
% 11.12/11.35 ; Feature-vector-row-index has 3,963 entries (3,964 at peak, 4,031 added, 68 deleted).
% 11.12/11.35 ; Feature-vector-row-index has 27,870 nodes (27,905 at peak, 29,281 added, 1,411 deleted).
% 11.12/11.35 ; Retrieved 86,622 possibly forward subsuming rows in 7,285 calls.
% 11.12/11.35 ; Retrieved 7,716 possibly backward subsumed rows in 4,031 calls.
% 11.12/11.35 ; Path-index has 12,994 entries (13,000 at peak, 13,541 added, 547 deleted).
% 11.12/11.35 ; Path-index has 5,055 nodes (5,058 at peak, 6,155 added, 1,100 deleted).
% 11.12/11.35 ; Trie-index has 12,994 entries (13,000 at peak, 13,541 added, 547 deleted).
% 11.12/11.35 ; Trie-index has 6,836 nodes (6,847 at peak, 8,735 added, 1,899 deleted).
% 11.12/11.35 ; Retrieved 25,773,255 generalization terms in 142,194 calls.
% 11.12/11.35 ; Retrieved 55,556 instance terms in 3,786 calls.
% 11.12/11.35 ; Retrieved 611,811 unifiable terms in 16,741 calls.
% 11.12/11.35 ;
% 11.12/11.35 ; The agenda of rows to process has 40 entries:
% 11.12/11.35 ; 1 with value 27 4 with value 32 1 with value 37
% 11.12/11.35 ; 1 with value 28 1 with value 33 1 with value 38
% 11.12/11.35 ; 6 with value 29 1 with value 34 1 with value 41
% 11.12/11.35 ; 6 with value 30 6 with value 35 1 with value 42
% 11.12/11.35 ; 4 with value 31 6 with value 36
% 11.12/11.35 ; The agenda of rows to give has 7231 entries:
% 11.12/11.35 ; 1 with value (4 15) 105 with value (4 38) 11 with value (4 61)
% 11.12/11.35 ; 4 with value (4 16) 268 with value (4 39) 13 with value (4 62)
% 11.12/11.35 ; 69 with value (4 17) 52 with value (4 40) 10 with value (4 63)
% 11.12/11.35 ; 114 with value (4 18) 49 with value (4 41) 23 with value (4 64)
% 11.12/11.35 ; 169 with value (4 19) 8 with value (4 42) 13 with value (4 65)
% 11.12/11.35 ; 251 with value (4 20) 3 with value (4 43) 16 with value (4 66)
% 11.12/11.35 ; 233 with value (4 21) 27 with value (4 44) 11 with value (4 67)
% 11.12/11.35 ; 284 with value (4 22) 3 with value (4 45) 16 with value (4 68)
% 11.12/11.35 ; 275 with value (4 23) 10 with value (4 46) 16 with value (4 69)
% 11.12/11.35 ; 311 with value (4 24) 3 with value (4 47) 17 with value (4 70)
% 11.12/11.35 ; 394 with value (4 25) 24 with value (4 48) 23 with value (4 71)
% 11.12/11.35 ; 561 with value (4 26) 4 with value (4 49) 18 with value (4 72)
% 11.12/11.35 ; 483 with value (4 27) 24 with value (4 50) 15 with value (4 73)
% 11.12/11.35 ; 589 with value (4 28) 15 with value (4 51) 30 with value (4 74)
% 11.12/11.35 ; 494 with value (4 29) 16 with value (4 52) 30 with value (4 75)
% 11.12/11.35 ; 250 with value (4 30) 17 with value (4 53) 10 with value (4 76)
% 11.12/11.35 ; 231 with value (4 31) 7 with value (4 54) 20 with value (4 78)
% 11.12/11.35 ; 178 with value (4 32) 26 with value (4 55) 2 with value (4 80)
% 11.12/11.35 ; 182 with value (4 33) 16 with value (4 56) 30 with value (4 81)
% 11.12/11.35 ; 246 with value (4 34) 10 with value (4 57) 10 with value (4 82)
% 11.12/11.35 ; 213 with value (4 35) 29 with value (4 58) 4 with value (4 83)
% 11.12/11.35 ; 230 with value (4 36) 12 with value (4 59) 10 with value (4 84)
% 11.12/11.35 ; 355 with value (4 37) 18 with value (4 60) 20 with value (4 86)
% 11.12/11.35 Evaluation took:
% 11.12/11.35 10.876 seconds of real time
% 11.12/11.35 10.218121 seconds of user run time
% 11.12/11.35 0.654762 seconds of system run time
% 11.12/11.35 [Run times include 0.392 seconds GC run time.]
% 11.12/11.35 0 calls to %EVAL
% 11.12/11.35 0 page faults and
% 11.12/11.35 377,566,664 bytes consed.
% 11.12/11.35 :PROOF-FOUND
% 11.12/11.35 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-05T10:15:15
% 11.12/11.35 :PROOF-FOUND
% 11.12/11.35 *
%------------------------------------------------------------------------------