TSTP Solution File: SWW591_2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWW591_2 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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:27 EDT 2022
% Result : Theorem 4.98s 5.14s
% Output : Refutation 4.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 290 ( 33 equ)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 242 ( 242 fml; 0 var)
% Number arithmetic : 4 ( 0 atm; 0 fun; 0 num; 4 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 26 ( 24 usr; 9 prp; 0-5 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 38 ( 0 sgn 38 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
tff(15,axiom,
! [X: ty,Y: uni] :
( ~ sort(X,Y)
| ( some_proj_1(X,some(X,Y)) = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',some_proj_1_def) ).
tff(40,axiom,
! [X: ty,Y: uni,Z: uni,U: uni,V: ty,W: uni] :
( ~ sort(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(41,axiom,
! [X: ty,Y: uni,Z: uni,U: ty,V: uni,W: uni] :
( ~ sort(X,Y)
| ~ sort(X,Z)
| ( Y = Z )
| ( get(U,X,set(U,X,V,Y,W),Z) = get(U,X,V,Z) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',select_neq) ).
tff(46,axiom,
! [X: uni] : ( t2tb(tb2t(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR) ).
tff(47,axiom,
! [X: option_int] : sort(option(int),t2tb1(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2tb_sort1) ).
tff(49,axiom,
! [X: uni] : ( t2tb1(tb2t1(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR1) ).
tff(50,axiom,
! [X: $int] : sort(int,t2tb2(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2tb_sort2) ).
tff(51,axiom,
! [X: $int] : ( tb2t2(t2tb2(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeL2) ).
tff(52,axiom,
! [X: uni] : ( t2tb2(tb2t2(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR2) ).
tff(53,axiom,
! [X: map_int_lpoption_intrp,Y: $int,Z: $int] :
( ~ inv(X)
| ( tb2t1(get(option(int),int,t2tb(X),t2tb2(Y))) != tb2t1(some(int,t2tb2(Z))) )
| ( Z = fib(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inv_def) ).
tff(54,axiom,
! [X: map_int_lpoption_intrp] :
( inv(X)
| ( tb2t1(get(option(int),int,t2tb(X),t2tb2('SKOLEMAAAV1.$int'(X)))) = tb2t1(some(int,t2tb2('SKOLEMAAAV2.$int'(X)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inv_def) ).
tff(55,axiom,
! [X: map_int_lpoption_intrp] :
( inv(X)
| ( 'SKOLEMAAAV2.$int'(X) != fib('SKOLEMAAAV1.$int'(X)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inv_def) ).
tff(59,negated_conjecture,
inv('SKOLEMAAAV5.map_int_lpoption_intrp'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_memo_fibo) ).
tff(60,negated_conjecture,
'SKOLEMAAAV6.map_int_lpoption_intrp' = tb2t(set(option(int),int,t2tb('SKOLEMAAAV5.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV3.$int'),some(int,t2tb2(fib('SKOLEMAAAV3.$int'))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_memo_fibo) ).
tff(61,negated_conjecture,
( ( fib('SKOLEMAAAV3.$int') != fib('SKOLEMAAAV3.$int') )
| ~ inv('SKOLEMAAAV6.map_int_lpoption_intrp') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_memo_fibo) ).
tff(62,plain,
~ inv('SKOLEMAAAV6.map_int_lpoption_intrp'),
inference('REWRITE',[status(thm)],[61,theory(equality)]) ).
tff(66,plain,
! [X: uni] : sort(option(int),X),
inference('PARAMODULATE',[status(thm)],[47,49,theory(equality)]) ).
tff(67,plain,
! [X: uni] : sort(int,X),
inference('PARAMODULATE',[status(thm)],[50,52,theory(equality)]) ).
tff(69,plain,
'SKOLEMAAAV2.$int'('SKOLEMAAAV6.map_int_lpoption_intrp') != fib('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')),
inference('UR-RESOLVE',[status(thm)],[55,62]) ).
tff(168,plain,
t2tb('SKOLEMAAAV6.map_int_lpoption_intrp') = set(option(int),int,t2tb('SKOLEMAAAV5.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV3.$int'),some(int,t2tb2(fib('SKOLEMAAAV3.$int')))),
inference('PARAMODULATE',[status(thm)],[46,60,theory(equality)]) ).
tff(180,plain,
tb2t1(get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')))) = tb2t1(some(int,t2tb2('SKOLEMAAAV2.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')))),
inference('HYPERRESOLVE',[status(thm)],[62,54]) ).
tff(290,plain,
! [X: uni] : ( some_proj_1(int,some(int,X)) = X ),
inference('HYPERRESOLVE',[status(thm)],[15,67]) ).
tff(295,plain,
! [X: uni,Y: uni,Z: ty,U: uni,V: uni] :
( ( X = Y )
| ( get(Z,int,set(Z,int,U,X,V),Y) = get(Z,int,U,Y) ) ),
inference('HYPERRESOLVE',[status(thm)],[41,67,67]) ).
tff(306,plain,
! [X: ty,Y: uni,Z: uni,U: uni] : ( get(option(int),X,set(option(int),X,Y,Z,U),Z) = U ),
inference('HYPERRESOLVE',[status(thm)],[40,66,theory(equality)]) ).
tff(326,plain,
tb2t1(get(option(int),int,t2tb('SKOLEMAAAV5.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')))) != tb2t1(get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')))),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[53,69,59]),180,theory(equality)]) ).
tff(854,plain,
get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV3.$int')) = some(int,t2tb2(fib('SKOLEMAAAV3.$int'))),
inference('PARAMODULATE',[status(thm)],[306,168,theory(equality)]) ).
tff(1040,plain,
get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp'))) = some(int,t2tb2('SKOLEMAAAV2.$int'('SKOLEMAAAV6.map_int_lpoption_intrp'))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[49,180,theory(equality)]),49,theory(equality)]) ).
tff(1042,plain,
some_proj_1(int,get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')))) = t2tb2('SKOLEMAAAV2.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')),
inference('PARAMODULATE',[status(thm)],[290,1040,theory(equality)]) ).
tff(1195,plain,
tb2t2(some_proj_1(int,get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp'))))) = 'SKOLEMAAAV2.$int'('SKOLEMAAAV6.map_int_lpoption_intrp'),
inference('PARAMODULATE',[status(thm)],[51,1042,theory(equality)]) ).
tff(1196,plain,
tb2t2(some_proj_1(int,get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp'))))) != fib('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')),
inference('REWRITE',[status(thm)],[69,1195,theory(equality)]) ).
tff(1525,plain,
! [X: uni] :
( ( t2tb2('SKOLEMAAAV3.$int') = X )
| ( get(option(int),int,t2tb('SKOLEMAAAV6.map_int_lpoption_intrp'),X) = get(option(int),int,t2tb('SKOLEMAAAV5.map_int_lpoption_intrp'),X) ) ),
inference('PARAMODULATE',[status(thm)],[295,168,theory(equality)]) ).
tff(2613,plain,
t2tb2('SKOLEMAAAV3.$int') = t2tb2('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[326,1525,theory(equality)]),theory(equality)]) ).
tff(2617,plain,
fib('SKOLEMAAAV3.$int') != fib('SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp')),
inference('REWRITE',[status(thm)],[1196,51,290,854,2613,theory(equality)]) ).
tff(2620,plain,
'SKOLEMAAAV3.$int' = 'SKOLEMAAAV1.$int'('SKOLEMAAAV6.map_int_lpoption_intrp'),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[51,2613,theory(equality)]),51,theory(equality)]) ).
cnf(2621,plain,
$false,
inference('REWRITE',[status(thm)],[2617,2620,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW591_2 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 6 00:05:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.49 #<PACKAGE "SNARK-USER">
% 0.21/0.49 *
% 0.21/0.49 SNARK-TPTP-OPTIONS
% 0.21/0.49 *
% 0.21/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49 (USE-FACTORING :POS)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49 *
% 0.21/0.49 "."
% 0.21/0.49 *
% 0.21/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-06T00:05:51
% 0.21/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-06T00:05:51
% 0.21/0.52 WARNING: Cannot use equality or equivalence (= ?X.tuple0 tuple02) as rewrite.
% 4.98/5.14
% 4.98/5.14
% 4.98/5.14 #||
% 4.98/5.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.98/5.14 % SZS output start Refutation
% See solution above
% 4.99/5.16 ||#
% 4.99/5.16
% 4.99/5.16 ; Summary of computation:
% 4.99/5.16 ; 16925 formulas have been input or derived (from 341 formulas).
% 4.99/5.16 ; 2621 (15%) were retained. Of these,
% 4.99/5.16 ; 50 ( 2%) were simplified or subsumed later,
% 4.99/5.16 ; 2571 (98%) are still being kept.
% 4.99/5.16 ;
% 4.99/5.16 ; Run time in seconds excluding printing time:
% 4.99/5.16 ; 0.014 0% Read assertion file (1 call)
% 4.99/5.16 ; 0.001 0% Assert (41 calls)
% 4.99/5.16 ; 0.299 6% Process new row (16,173 calls)
% 4.99/5.16 ; 0.304 7% Resolution (680 calls)
% 4.99/5.16 ; 0.094 2% Paramodulation (340 calls)
% 4.99/5.16 ; 0.000 0% Factoring (89 calls)
% 4.99/5.16 ; 1.867 40% Condensing (5,058 calls)
% 4.99/5.16 ; 0.283 6% Forward subsumption (5,058 calls)
% 4.99/5.16 ; 0.096 2% Backward subsumption (2,385 calls)
% 4.99/5.16 ; 0.818 18% Clause clause subsumption (9,422 calls)
% 4.99/5.16 ; 0.529 11% Forward simplification (16,001 calls)
% 4.99/5.16 ; 0.009 0% Backward simplification (2,619 calls)
% 4.99/5.16 ; 0.049 1% Ordering (30,076 calls)
% 4.99/5.16 ; 0.212 5% Sortal reasoning (328,057 calls)
% 4.99/5.16 ; 0.001 0% Purity testing (1 call)
% 4.99/5.16 ; 0.076 2% Other
% 4.99/5.16 ; 4.652 Total
% 4.99/5.16 ; 4.669 Real time
% 4.99/5.16 ;
% 4.99/5.16 ; Term-hash-array has 6,997 terms in all.
% 4.99/5.16 ; Feature-vector-row-index has 2,372 entries (2,377 at peak, 2,385 added, 13 deleted).
% 4.99/5.16 ; Feature-vector-row-index has 18,834 nodes (18,941 at peak, 18,959 added, 125 deleted).
% 4.99/5.16 ; Retrieved 25,665 possibly forward subsuming rows in 5,058 calls.
% 4.99/5.16 ; Retrieved 762 possibly backward subsumed rows in 2,385 calls.
% 4.99/5.16 ; Path-index has 6,918 entries (6,981 at peak, 7,019 added, 101 deleted).
% 4.99/5.16 ; Path-index has 4,419 nodes (4,461 at peak, 4,520 added, 101 deleted).
% 4.99/5.16 ; Trie-index has 6,918 entries (6,981 at peak, 7,019 added, 101 deleted).
% 4.99/5.16 ; Trie-index has 32,812 nodes (33,407 at peak, 33,530 added, 718 deleted).
% 4.99/5.16 ; Retrieved 52,061 generalization terms in 93,735 calls.
% 4.99/5.16 ; Retrieved 892 instance terms in 233 calls.
% 4.99/5.16 ; Retrieved 134,609 unifiable terms in 8,063 calls.
% 4.99/5.16 ;
% 4.99/5.16 ; The agenda of backward simplifiable rows to process has 2 entries:
% 4.99/5.16 ; 2 with value 0
% 4.99/5.16 ; The agenda of rows to process has 55 entries:
% 4.99/5.16 ; 1 with value 24 6 with value 29 5 with value 34
% 4.99/5.16 ; 2 with value 25 4 with value 30 5 with value 35
% 4.99/5.16 ; 4 with value 26 8 with value 31 1 with value 38
% 4.99/5.16 ; 4 with value 27 4 with value 32 1 with value 39
% 4.99/5.16 ; 6 with value 28 4 with value 33
% 4.99/5.16 ; The agenda of rows to give has 2251 entries:
% 4.99/5.16 ; 1 with value (4 11) 151 with value (4 38) 17 with value (4 51)
% 4.99/5.16 ; 1 with value (4 17) 171 with value (4 39) 18 with value (4 52)
% 4.99/5.16 ; 1 with value (4 23) 181 with value (4 40) 16 with value (4 53)
% 4.99/5.16 ; 21 with value (4 28) 159 with value (4 41) 5 with value (4 55)
% 4.99/5.16 ; 26 with value (4 29) 176 with value (4 42) 12 with value (4 57)
% 4.99/5.16 ; 34 with value (4 30) 155 with value (4 43) 1 with value (4 60)
% 4.99/5.16 ; 32 with value (4 31) 126 with value (4 44) 7 with value (4 61)
% 4.99/5.16 ; 40 with value (4 32) 127 with value (4 45) 2 with value (4 62)
% 4.99/5.16 ; 60 with value (4 33) 94 with value (4 46) 1 with value (4 63)
% 4.99/5.16 ; 81 with value (4 34) 68 with value (4 47) 1 with value (4 64)
% 4.99/5.16 ; 90 with value (4 35) 46 with value (4 48) 4 with value (4 66)
% 4.99/5.16 ; 127 with value (4 36) 49 with value (4 49) 2 with value (4 70)
% 4.99/5.16 ; 131 with value (4 37) 17 with value (4 50)
% 4.99/5.16 Evaluation took:
% 4.99/5.16 4.67 seconds of real time
% 4.99/5.16 4.166115 seconds of user run time
% 4.99/5.16 0.502091 seconds of system run time
% 4.99/5.16 [Run times include 0.262 seconds GC run time.]
% 4.99/5.16 0 calls to %EVAL
% 4.99/5.16 0 page faults and
% 4.99/5.16 327,885,144 bytes consed.
% 4.99/5.16 :PROOF-FOUND
% 4.99/5.16 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-06T00:05:55
% 4.99/5.16 :PROOF-FOUND
% 4.99/5.16 *
%------------------------------------------------------------------------------